./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/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 3b7d4038cc97a5525f6c2d1d321f9913af8a8ee1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/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 3b7d4038cc97a5525f6c2d1d321f9913af8a8ee1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:42:11,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:42:11,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:42:11,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:42:11,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:42:11,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:42:11,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:42:11,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:42:11,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:42:11,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:42:11,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:42:11,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:42:11,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:42:11,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:42:11,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:42:11,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:42:11,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:42:11,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:42:11,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:42:11,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:42:11,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:42:11,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:42:11,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:42:11,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:42:11,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:42:11,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:42:11,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:42:11,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:42:11,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:42:11,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:42:11,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:42:11,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:42:11,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:42:11,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:42:11,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:42:11,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:42:11,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:42:11,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:42:11,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:42:11,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:42:11,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:42:11,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:42:11,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:42:11,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:42:11,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:42:11,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:42:11,263 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:42:11,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:42:11,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:42:11,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:42:11,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:42:11,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:42:11,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:42:11,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:42:11,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:42:11,265 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:42:11,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:42:11,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:42:11,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:42:11,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:42:11,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:42:11,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:42:11,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:42:11,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:42:11,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:42:11,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:42:11,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:42:11,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:42:11,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:42:11,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:42:11,269 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_9ea1ac20-63cc-4a81-b8fd-b01e18303419/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 -> 3b7d4038cc97a5525f6c2d1d321f9913af8a8ee1 [2019-11-16 00:42:11,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:42:11,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:42:11,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:42:11,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:42:11,309 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:42:11,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:42:11,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/7cbf6ff48/a181d48bf8bb4630a3d3a4ea04ce4dfb/FLAGd4c332645 [2019-11-16 00:42:11,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:42:11,930 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:42:11,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/7cbf6ff48/a181d48bf8bb4630a3d3a4ea04ce4dfb/FLAGd4c332645 [2019-11-16 00:42:12,378 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/7cbf6ff48/a181d48bf8bb4630a3d3a4ea04ce4dfb [2019-11-16 00:42:12,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:42:12,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:42:12,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:12,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:42:12,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:42:12,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:12" (1/1) ... [2019-11-16 00:42:12,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20921137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:12, skipping insertion in model container [2019-11-16 00:42:12,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:12" (1/1) ... [2019-11-16 00:42:12,397 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:42:12,469 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:42:13,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:13,073 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:42:13,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:13,271 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:42:13,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13 WrapperNode [2019-11-16 00:42:13,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:13,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:13,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:42:13,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:42:13,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:13,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:42:13,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:42:13,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:42:13,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... [2019-11-16 00:42:13,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:42:13,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:42:13,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:42:13,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:42:13,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:42:13,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:42:13,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:42:13,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:42:13,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:42:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:42:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:42:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:42:13,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:42:13,753 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:42:14,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:42:14,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:42:14,639 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:42:14,640 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:42:14,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:14 BoogieIcfgContainer [2019-11-16 00:42:14,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:42:14,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:42:14,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:42:14,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:42:14,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:12" (1/3) ... [2019-11-16 00:42:14,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58acfddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:14, skipping insertion in model container [2019-11-16 00:42:14,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:13" (2/3) ... [2019-11-16 00:42:14,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58acfddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:14, skipping insertion in model container [2019-11-16 00:42:14,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:14" (3/3) ... [2019-11-16 00:42:14,650 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:42:14,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:42:14,667 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:42:14,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:42:14,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:42:14,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:42:14,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:42:14,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:42:14,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:42:14,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:42:14,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:42:14,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:42:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:42:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:42:14,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:14,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:14,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-16 00:42:14,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:14,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361210341] [2019-11-16 00:42:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:14,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:15,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361210341] [2019-11-16 00:42:15,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:15,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:15,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750151521] [2019-11-16 00:42:15,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:15,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:15,062 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-16 00:42:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:15,574 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-16 00:42:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:15,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:42:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:15,587 INFO L225 Difference]: With dead ends: 323 [2019-11-16 00:42:15,587 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:42:15,593 INFO L600 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-11-16 00:42:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:42:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-16 00:42:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-16 00:42:15,654 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-16 00:42:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:15,655 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-16 00:42:15,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-16 00:42:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:42:15,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:15,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:15,659 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-16 00:42:15,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:15,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702359654] [2019-11-16 00:42:15,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:15,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:15,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:15,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702359654] [2019-11-16 00:42:15,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:15,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:15,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147297922] [2019-11-16 00:42:15,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:15,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:15,839 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-16 00:42:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:16,255 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-16 00:42:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:16,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-16 00:42:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:16,258 INFO L225 Difference]: With dead ends: 290 [2019-11-16 00:42:16,258 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:42:16,259 INFO L600 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-11-16 00:42:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:42:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-16 00:42:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-16 00:42:16,277 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-16 00:42:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:16,278 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-16 00:42:16,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-16 00:42:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:42:16,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:16,285 INFO L380 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-11-16 00:42:16,286 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-16 00:42:16,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:16,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078225030] [2019-11-16 00:42:16,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:16,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078225030] [2019-11-16 00:42:16,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:16,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:16,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348603019] [2019-11-16 00:42:16,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:16,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:16,430 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-16 00:42:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:16,788 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-16 00:42:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:16,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:42:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:16,790 INFO L225 Difference]: With dead ends: 289 [2019-11-16 00:42:16,791 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:42:16,792 INFO L600 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-11-16 00:42:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:42:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-16 00:42:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-16 00:42:16,801 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-16 00:42:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:16,806 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-16 00:42:16,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-16 00:42:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:42:16,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:16,810 INFO L380 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-11-16 00:42:16,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-16 00:42:16,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:16,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234978850] [2019-11-16 00:42:16,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:16,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234978850] [2019-11-16 00:42:16,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:16,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:16,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944426913] [2019-11-16 00:42:16,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:16,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:16,900 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-16 00:42:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:17,224 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-16 00:42:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:17,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:42:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:17,226 INFO L225 Difference]: With dead ends: 287 [2019-11-16 00:42:17,226 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:42:17,227 INFO L600 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-11-16 00:42:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:42:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-16 00:42:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-16 00:42:17,245 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-16 00:42:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:17,246 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-16 00:42:17,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-16 00:42:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:42:17,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:17,249 INFO L380 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-11-16 00:42:17,249 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-16 00:42:17,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:17,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610201694] [2019-11-16 00:42:17,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:17,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610201694] [2019-11-16 00:42:17,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:17,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:17,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375495177] [2019-11-16 00:42:17,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:17,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:17,337 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-16 00:42:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:17,662 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-16 00:42:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:17,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:42:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:17,664 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:42:17,664 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:42:17,664 INFO L600 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-11-16 00:42:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:42:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:42:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-16 00:42:17,679 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-16 00:42:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:17,680 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-16 00:42:17,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-16 00:42:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:42:17,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:17,682 INFO L380 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-11-16 00:42:17,682 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:17,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:17,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-16 00:42:17,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:17,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436804964] [2019-11-16 00:42:17,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:17,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436804964] [2019-11-16 00:42:17,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:17,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:17,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343003890] [2019-11-16 00:42:17,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:17,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:17,753 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-16 00:42:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:18,064 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-16 00:42:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:18,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:42:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:18,069 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:42:18,069 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:42:18,070 INFO L600 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-11-16 00:42:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:42:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:42:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-16 00:42:18,076 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-16 00:42:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:18,076 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-16 00:42:18,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-16 00:42:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:42:18,080 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:18,080 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:18,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-16 00:42:18,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:18,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726219728] [2019-11-16 00:42:18,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:18,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726219728] [2019-11-16 00:42:18,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:18,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:18,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009840636] [2019-11-16 00:42:18,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:18,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:18,171 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-16 00:42:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:18,464 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-16 00:42:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:18,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-16 00:42:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:18,466 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:42:18,466 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:42:18,466 INFO L600 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-11-16 00:42:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:42:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:42:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-16 00:42:18,472 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-16 00:42:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:18,472 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-16 00:42:18,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-16 00:42:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:42:18,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:18,473 INFO L380 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-11-16 00:42:18,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-16 00:42:18,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:18,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322526569] [2019-11-16 00:42:18,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:18,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322526569] [2019-11-16 00:42:18,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:18,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:18,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311374602] [2019-11-16 00:42:18,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:18,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:18,524 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-16 00:42:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:18,833 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-16 00:42:18,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:18,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-16 00:42:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:18,834 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:42:18,835 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:42:18,835 INFO L600 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-11-16 00:42:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:42:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:42:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-16 00:42:18,840 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-16 00:42:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:18,840 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-16 00:42:18,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-16 00:42:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:42:18,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:18,841 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:18,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-16 00:42:18,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:18,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770122474] [2019-11-16 00:42:18,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:18,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770122474] [2019-11-16 00:42:18,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:18,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:18,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372503311] [2019-11-16 00:42:18,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:18,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:18,908 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-16 00:42:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:19,172 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-16 00:42:19,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:19,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:42:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:19,173 INFO L225 Difference]: With dead ends: 276 [2019-11-16 00:42:19,174 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:42:19,174 INFO L600 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-11-16 00:42:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:42:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-16 00:42:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:42:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-16 00:42:19,178 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-16 00:42:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:19,178 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-16 00:42:19,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-16 00:42:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:42:19,179 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:19,179 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:19,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-16 00:42:19,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:19,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272133220] [2019-11-16 00:42:19,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:19,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:19,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272133220] [2019-11-16 00:42:19,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:19,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:19,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649000760] [2019-11-16 00:42:19,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:19,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:19,244 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-16 00:42:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:19,569 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-16 00:42:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:19,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:42:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:19,571 INFO L225 Difference]: With dead ends: 316 [2019-11-16 00:42:19,572 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:42:19,572 INFO L600 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-11-16 00:42:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:42:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-16 00:42:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-16 00:42:19,577 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-16 00:42:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:19,577 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-16 00:42:19,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-16 00:42:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:42:19,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:19,579 INFO L380 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-11-16 00:42:19,579 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-16 00:42:19,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:19,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559319725] [2019-11-16 00:42:19,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:19,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:19,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:19,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559319725] [2019-11-16 00:42:19,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:19,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:19,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745949564] [2019-11-16 00:42:19,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:19,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:19,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:19,670 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-16 00:42:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:20,014 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-16 00:42:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:20,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:42:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:20,016 INFO L225 Difference]: With dead ends: 338 [2019-11-16 00:42:20,016 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:42:20,016 INFO L600 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-11-16 00:42:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:42:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-16 00:42:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-16 00:42:20,022 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-16 00:42:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:20,022 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-16 00:42:20,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-16 00:42:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:42:20,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:20,023 INFO L380 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-11-16 00:42:20,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-16 00:42:20,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:20,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075285968] [2019-11-16 00:42:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:20,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075285968] [2019-11-16 00:42:20,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:20,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:20,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216423092] [2019-11-16 00:42:20,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:20,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:20,086 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-16 00:42:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:20,430 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-16 00:42:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:20,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:42:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:20,432 INFO L225 Difference]: With dead ends: 337 [2019-11-16 00:42:20,432 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:42:20,433 INFO L600 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-11-16 00:42:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:42:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-16 00:42:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-16 00:42:20,438 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-16 00:42:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:20,438 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-16 00:42:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-16 00:42:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:42:20,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:20,439 INFO L380 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-11-16 00:42:20,439 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-16 00:42:20,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:20,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54524260] [2019-11-16 00:42:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:20,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54524260] [2019-11-16 00:42:20,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:20,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:20,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107072325] [2019-11-16 00:42:20,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:20,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:20,503 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-16 00:42:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:20,867 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-16 00:42:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:20,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:42:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:20,869 INFO L225 Difference]: With dead ends: 335 [2019-11-16 00:42:20,869 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:42:20,870 INFO L600 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-11-16 00:42:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:42:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-16 00:42:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-16 00:42:20,875 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-16 00:42:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:20,875 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-16 00:42:20,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-16 00:42:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:42:20,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:20,876 INFO L380 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-11-16 00:42:20,876 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-16 00:42:20,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:20,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437750928] [2019-11-16 00:42:20,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:20,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:20,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437750928] [2019-11-16 00:42:20,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:20,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:20,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379308096] [2019-11-16 00:42:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:20,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:20,942 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-16 00:42:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:21,294 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-16 00:42:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:21,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:42:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:21,296 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:42:21,296 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:42:21,297 INFO L600 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-11-16 00:42:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:42:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:42:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-16 00:42:21,302 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-16 00:42:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:21,303 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-16 00:42:21,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-16 00:42:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:42:21,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:21,304 INFO L380 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-11-16 00:42:21,304 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-16 00:42:21,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:21,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102693107] [2019-11-16 00:42:21,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:21,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:21,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:21,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102693107] [2019-11-16 00:42:21,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:21,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:21,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622445681] [2019-11-16 00:42:21,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:21,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:21,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:21,392 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-16 00:42:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:21,720 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-16 00:42:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:21,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:42:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:21,722 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:42:21,722 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:42:21,722 INFO L600 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-11-16 00:42:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:42:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:42:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-16 00:42:21,727 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-16 00:42:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-16 00:42:21,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-16 00:42:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:42:21,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:21,729 INFO L380 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-11-16 00:42:21,729 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-16 00:42:21,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:21,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660904764] [2019-11-16 00:42:21,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:21,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:21,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:21,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660904764] [2019-11-16 00:42:21,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:21,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:21,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527533007] [2019-11-16 00:42:21,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:21,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:21,775 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-16 00:42:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:22,053 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-16 00:42:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:42:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:22,055 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:42:22,055 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:42:22,056 INFO L600 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-11-16 00:42:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:42:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:42:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-16 00:42:22,061 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-16 00:42:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:22,061 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-16 00:42:22,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-16 00:42:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:42:22,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:22,062 INFO L380 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-11-16 00:42:22,062 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-16 00:42:22,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:22,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92747854] [2019-11-16 00:42:22,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:22,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92747854] [2019-11-16 00:42:22,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:22,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:22,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897414608] [2019-11-16 00:42:22,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:22,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:22,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:22,106 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-16 00:42:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:22,439 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-16 00:42:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:22,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:42:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:22,440 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:42:22,441 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:42:22,441 INFO L600 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-11-16 00:42:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:42:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:42:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-16 00:42:22,446 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-16 00:42:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:22,446 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-16 00:42:22,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-16 00:42:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:42:22,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:22,447 INFO L380 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-11-16 00:42:22,447 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-16 00:42:22,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:22,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093760680] [2019-11-16 00:42:22,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:22,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093760680] [2019-11-16 00:42:22,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:22,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:22,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011234855] [2019-11-16 00:42:22,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:22,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:22,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:22,493 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-16 00:42:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:22,774 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-16 00:42:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:22,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:42:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:22,776 INFO L225 Difference]: With dead ends: 324 [2019-11-16 00:42:22,776 INFO L226 Difference]: Without dead ends: 175 [2019-11-16 00:42:22,777 INFO L600 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-11-16 00:42:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-16 00:42:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-16 00:42:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:42:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-16 00:42:22,782 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-16 00:42:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:22,783 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-16 00:42:22,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-16 00:42:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:42:22,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:22,784 INFO L380 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-11-16 00:42:22,785 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-16 00:42:22,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:22,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866293546] [2019-11-16 00:42:22,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:22,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:22,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866293546] [2019-11-16 00:42:22,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:22,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:22,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828003615] [2019-11-16 00:42:22,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:22,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:22,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:22,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:22,864 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-16 00:42:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:23,343 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-16 00:42:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:23,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:42:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:23,345 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:42:23,345 INFO L226 Difference]: Without dead ends: 275 [2019-11-16 00:42:23,346 INFO L600 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-11-16 00:42:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-16 00:42:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-16 00:42:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-16 00:42:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-16 00:42:23,352 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-16 00:42:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:23,353 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-16 00:42:23,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-16 00:42:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:42:23,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:23,354 INFO L380 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-11-16 00:42:23,354 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-16 00:42:23,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:23,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714868262] [2019-11-16 00:42:23,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:23,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:23,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:23,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714868262] [2019-11-16 00:42:23,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:23,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:23,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614538245] [2019-11-16 00:42:23,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:23,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:23,408 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-16 00:42:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:23,671 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-16 00:42:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:23,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:42:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:23,673 INFO L225 Difference]: With dead ends: 427 [2019-11-16 00:42:23,673 INFO L226 Difference]: Without dead ends: 248 [2019-11-16 00:42:23,674 INFO L600 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-11-16 00:42:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-16 00:42:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-16 00:42:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-16 00:42:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-16 00:42:23,679 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-16 00:42:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:23,680 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-16 00:42:23,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-16 00:42:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:42:23,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:23,681 INFO L380 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-11-16 00:42:23,681 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-16 00:42:23,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:23,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923079384] [2019-11-16 00:42:23,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:23,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:23,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:23,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923079384] [2019-11-16 00:42:23,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:23,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:23,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833175017] [2019-11-16 00:42:23,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:23,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:23,792 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-16 00:42:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:24,169 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-16 00:42:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:24,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-16 00:42:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:24,171 INFO L225 Difference]: With dead ends: 494 [2019-11-16 00:42:24,171 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:42:24,172 INFO L600 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-11-16 00:42:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:42:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-16 00:42:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-16 00:42:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-16 00:42:24,178 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-16 00:42:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:24,178 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-16 00:42:24,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-16 00:42:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:42:24,179 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:24,179 INFO L380 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-11-16 00:42:24,180 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2019-11-16 00:42:24,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:24,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923210000] [2019-11-16 00:42:24,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:24,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:24,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:24,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923210000] [2019-11-16 00:42:24,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:24,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:24,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59586967] [2019-11-16 00:42:24,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:24,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:24,249 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-16 00:42:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:24,697 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-16 00:42:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:24,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-16 00:42:24,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:24,701 INFO L225 Difference]: With dead ends: 495 [2019-11-16 00:42:24,701 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:42:24,702 INFO L600 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-11-16 00:42:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:42:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-16 00:42:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-16 00:42:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-16 00:42:24,709 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-16 00:42:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:24,709 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-16 00:42:24,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-16 00:42:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:42:24,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:24,711 INFO L380 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-11-16 00:42:24,711 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:24,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2019-11-16 00:42:24,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:24,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252006556] [2019-11-16 00:42:24,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:24,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:24,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:24,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252006556] [2019-11-16 00:42:24,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:24,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:24,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540155403] [2019-11-16 00:42:24,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:24,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:24,797 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-16 00:42:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:25,254 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-16 00:42:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:25,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:42:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:25,256 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:42:25,256 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:42:25,257 INFO L600 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-11-16 00:42:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:42:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-16 00:42:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-16 00:42:25,264 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-16 00:42:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:25,264 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-16 00:42:25,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-16 00:42:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:42:25,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:25,265 INFO L380 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-11-16 00:42:25,266 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-16 00:42:25,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:25,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820935174] [2019-11-16 00:42:25,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:25,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:25,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:25,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820935174] [2019-11-16 00:42:25,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:25,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:25,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553236617] [2019-11-16 00:42:25,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:25,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:25,341 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-16 00:42:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:25,747 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-16 00:42:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:25,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:42:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:25,749 INFO L225 Difference]: With dead ends: 500 [2019-11-16 00:42:25,749 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:42:25,749 INFO L600 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-11-16 00:42:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:42:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-16 00:42:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-16 00:42:25,755 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-16 00:42:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:25,756 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-16 00:42:25,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-16 00:42:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:42:25,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:25,757 INFO L380 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-11-16 00:42:25,757 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-16 00:42:25,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:25,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468402030] [2019-11-16 00:42:25,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:25,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:25,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:25,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468402030] [2019-11-16 00:42:25,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:25,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:25,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955344106] [2019-11-16 00:42:25,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:25,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:25,817 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-16 00:42:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:26,138 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-16 00:42:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:26,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:42:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:26,140 INFO L225 Difference]: With dead ends: 475 [2019-11-16 00:42:26,140 INFO L226 Difference]: Without dead ends: 260 [2019-11-16 00:42:26,141 INFO L600 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-11-16 00:42:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-16 00:42:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-16 00:42:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-16 00:42:26,148 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-16 00:42:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:26,148 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-16 00:42:26,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-16 00:42:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:26,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:26,150 INFO L380 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-11-16 00:42:26,150 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-16 00:42:26,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:26,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317243810] [2019-11-16 00:42:26,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:26,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:26,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:26,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317243810] [2019-11-16 00:42:26,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:26,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:26,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71833494] [2019-11-16 00:42:26,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:26,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:26,221 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-16 00:42:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:26,741 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-16 00:42:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:26,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:42:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:26,743 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:42:26,743 INFO L226 Difference]: Without dead ends: 284 [2019-11-16 00:42:26,744 INFO L600 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-11-16 00:42:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-16 00:42:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-16 00:42:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-16 00:42:26,749 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-16 00:42:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:26,750 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-16 00:42:26,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-16 00:42:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:26,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:26,751 INFO L380 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-11-16 00:42:26,751 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:26,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-16 00:42:26,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:26,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212125296] [2019-11-16 00:42:26,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:26,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:26,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:26,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212125296] [2019-11-16 00:42:26,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:26,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:26,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455757311] [2019-11-16 00:42:26,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:26,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:26,807 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-16 00:42:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:27,266 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-16 00:42:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:27,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:42:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:27,268 INFO L225 Difference]: With dead ends: 497 [2019-11-16 00:42:27,268 INFO L226 Difference]: Without dead ends: 282 [2019-11-16 00:42:27,269 INFO L600 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-11-16 00:42:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-16 00:42:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-16 00:42:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-16 00:42:27,275 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-16 00:42:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:27,275 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-16 00:42:27,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-16 00:42:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:27,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:27,276 INFO L380 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-11-16 00:42:27,276 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-16 00:42:27,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:27,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020122649] [2019-11-16 00:42:27,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:27,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:27,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:27,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020122649] [2019-11-16 00:42:27,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:27,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:27,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383673112] [2019-11-16 00:42:27,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:27,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:27,331 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-16 00:42:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:27,717 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-16 00:42:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:27,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:42:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:27,718 INFO L225 Difference]: With dead ends: 496 [2019-11-16 00:42:27,719 INFO L226 Difference]: Without dead ends: 281 [2019-11-16 00:42:27,719 INFO L600 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-11-16 00:42:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-16 00:42:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-16 00:42:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:42:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-16 00:42:27,725 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-16 00:42:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-16 00:42:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-16 00:42:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:27,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:27,727 INFO L380 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-11-16 00:42:27,727 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-16 00:42:27,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:27,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587452878] [2019-11-16 00:42:27,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:27,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:27,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:42:27,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587452878] [2019-11-16 00:42:27,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:27,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:42:27,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195980669] [2019-11-16 00:42:27,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:42:27,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:27,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:42:27,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:27,805 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-16 00:42:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:28,373 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-16 00:42:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:28,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-16 00:42:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:28,375 INFO L225 Difference]: With dead ends: 470 [2019-11-16 00:42:28,375 INFO L226 Difference]: Without dead ends: 255 [2019-11-16 00:42:28,376 INFO L600 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-11-16 00:42:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-16 00:42:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-16 00:42:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-16 00:42:28,384 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-16 00:42:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:28,384 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-16 00:42:28,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:42:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-16 00:42:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:28,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:28,386 INFO L380 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-11-16 00:42:28,386 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-16 00:42:28,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:28,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950781043] [2019-11-16 00:42:28,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:28,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:28,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:28,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950781043] [2019-11-16 00:42:28,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:28,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:28,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127872140] [2019-11-16 00:42:28,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:28,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:28,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:28,452 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-16 00:42:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:28,806 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-16 00:42:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:28,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:42:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:28,808 INFO L225 Difference]: With dead ends: 512 [2019-11-16 00:42:28,809 INFO L226 Difference]: Without dead ends: 277 [2019-11-16 00:42:28,809 INFO L600 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-11-16 00:42:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-16 00:42:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-16 00:42:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-16 00:42:28,817 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-16 00:42:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:28,818 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-16 00:42:28,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-16 00:42:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:42:28,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:28,819 INFO L380 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-11-16 00:42:28,820 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-16 00:42:28,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:28,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210689790] [2019-11-16 00:42:28,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:28,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:28,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:28,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210689790] [2019-11-16 00:42:28,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:28,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:28,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209382688] [2019-11-16 00:42:28,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:28,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:28,878 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-16 00:42:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:29,258 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-16 00:42:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:29,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:42:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:29,260 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:42:29,260 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:42:29,261 INFO L600 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-11-16 00:42:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:42:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:42:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-16 00:42:29,268 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-16 00:42:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:29,268 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-16 00:42:29,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-16 00:42:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:42:29,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:29,269 INFO L380 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-11-16 00:42:29,270 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-16 00:42:29,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:29,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417431174] [2019-11-16 00:42:29,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:29,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:29,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:29,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417431174] [2019-11-16 00:42:29,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:29,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:29,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062566489] [2019-11-16 00:42:29,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:29,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:29,325 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-16 00:42:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:29,836 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-16 00:42:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:29,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:42:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:29,838 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:42:29,838 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:42:29,839 INFO L600 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-11-16 00:42:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:42:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:42:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-16 00:42:29,847 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-16 00:42:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:29,847 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-16 00:42:29,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-16 00:42:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:42:29,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:29,848 INFO L380 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-11-16 00:42:29,848 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-16 00:42:29,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:29,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102648774] [2019-11-16 00:42:29,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:29,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:29,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:29,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102648774] [2019-11-16 00:42:29,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:29,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:29,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539050226] [2019-11-16 00:42:29,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:29,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:29,904 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-16 00:42:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:30,265 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-16 00:42:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:30,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:42:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:30,268 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:42:30,268 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:42:30,268 INFO L600 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-11-16 00:42:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:42:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:42:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-16 00:42:30,278 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-16 00:42:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:30,278 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-16 00:42:30,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-16 00:42:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:42:30,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:30,279 INFO L380 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-11-16 00:42:30,280 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:30,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-16 00:42:30,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:30,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019415388] [2019-11-16 00:42:30,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:30,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:30,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:30,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019415388] [2019-11-16 00:42:30,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:30,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:30,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660658961] [2019-11-16 00:42:30,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:30,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:30,343 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-16 00:42:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:30,694 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-16 00:42:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:30,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-16 00:42:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:30,696 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:42:30,696 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:42:30,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:42:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:42:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-16 00:42:30,705 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-16 00:42:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:30,705 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-16 00:42:30,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-16 00:42:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:42:30,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:30,706 INFO L380 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-11-16 00:42:30,706 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-16 00:42:30,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:30,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881644623] [2019-11-16 00:42:30,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:30,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:30,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:30,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881644623] [2019-11-16 00:42:30,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:30,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:30,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768053948] [2019-11-16 00:42:30,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:30,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:30,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:30,776 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-16 00:42:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:31,081 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-16 00:42:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:31,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-16 00:42:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:31,084 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:42:31,084 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:42:31,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:42:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:42:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-16 00:42:31,091 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-16 00:42:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:31,092 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-16 00:42:31,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-16 00:42:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:42:31,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:31,093 INFO L380 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-11-16 00:42:31,093 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-16 00:42:31,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:31,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246094890] [2019-11-16 00:42:31,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:31,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:31,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:31,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246094890] [2019-11-16 00:42:31,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:31,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:31,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991243018] [2019-11-16 00:42:31,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:31,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:31,145 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-16 00:42:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:31,605 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-16 00:42:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:31,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:42:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:31,607 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:42:31,607 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:42:31,608 INFO L600 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-11-16 00:42:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:42:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:42:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-16 00:42:31,620 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-16 00:42:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:31,620 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-16 00:42:31,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-16 00:42:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:42:31,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:31,621 INFO L380 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-11-16 00:42:31,622 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-16 00:42:31,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:31,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562241822] [2019-11-16 00:42:31,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:31,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:31,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:31,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562241822] [2019-11-16 00:42:31,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:31,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:31,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281533840] [2019-11-16 00:42:31,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:31,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:31,682 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-16 00:42:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:32,072 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-16 00:42:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:32,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:42:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:32,075 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:42:32,075 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:42:32,075 INFO L600 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-11-16 00:42:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:42:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:42:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-16 00:42:32,083 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-16 00:42:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:32,083 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-16 00:42:32,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-16 00:42:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:42:32,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:32,085 INFO L380 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-11-16 00:42:32,085 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:32,085 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-16 00:42:32,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:32,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083582603] [2019-11-16 00:42:32,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:32,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083582603] [2019-11-16 00:42:32,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:32,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:32,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132917943] [2019-11-16 00:42:32,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:32,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:32,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:32,156 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-16 00:42:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:32,512 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-16 00:42:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:32,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:42:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:32,514 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:42:32,515 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:42:32,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:42:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-16 00:42:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-16 00:42:32,524 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-16 00:42:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:32,525 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-16 00:42:32,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-16 00:42:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:42:32,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:32,526 INFO L380 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-11-16 00:42:32,527 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-16 00:42:32,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:32,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105638579] [2019-11-16 00:42:32,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:32,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105638579] [2019-11-16 00:42:32,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:32,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:32,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128424986] [2019-11-16 00:42:32,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:32,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:32,605 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-16 00:42:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:32,906 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-16 00:42:32,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:32,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:42:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:32,908 INFO L225 Difference]: With dead ends: 501 [2019-11-16 00:42:32,908 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:42:32,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:42:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-16 00:42:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-16 00:42:32,918 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-16 00:42:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:32,918 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-16 00:42:32,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-16 00:42:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:42:32,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:32,920 INFO L380 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-11-16 00:42:32,920 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-16 00:42:32,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:32,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301266123] [2019-11-16 00:42:32,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:32,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:32,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301266123] [2019-11-16 00:42:32,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:32,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:32,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975661323] [2019-11-16 00:42:32,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:32,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:32,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:32,986 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-16 00:42:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:33,450 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-16 00:42:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:33,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:42:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:33,453 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:42:33,453 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:42:33,454 INFO L600 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-11-16 00:42:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:42:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-16 00:42:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:42:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-16 00:42:33,462 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-16 00:42:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:33,463 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-16 00:42:33,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-16 00:42:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:42:33,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:33,464 INFO L380 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-11-16 00:42:33,464 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-16 00:42:33,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:33,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981519593] [2019-11-16 00:42:33,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:42:33,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981519593] [2019-11-16 00:42:33,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:33,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:33,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312787657] [2019-11-16 00:42:33,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:33,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:33,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:33,521 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-16 00:42:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:33,578 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-16 00:42:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:33,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-16 00:42:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:33,581 INFO L225 Difference]: With dead ends: 722 [2019-11-16 00:42:33,581 INFO L226 Difference]: Without dead ends: 487 [2019-11-16 00:42:33,583 INFO L600 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-11-16 00:42:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-16 00:42:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-16 00:42:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-16 00:42:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-16 00:42:33,603 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-16 00:42:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:33,604 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-16 00:42:33,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-16 00:42:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:42:33,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:33,605 INFO L380 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-11-16 00:42:33,606 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-16 00:42:33,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:33,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187917425] [2019-11-16 00:42:33,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:42:33,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187917425] [2019-11-16 00:42:33,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:33,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:33,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937337091] [2019-11-16 00:42:33,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:33,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:33,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:33,664 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-16 00:42:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:33,724 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-16 00:42:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:33,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:42:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:33,728 INFO L225 Difference]: With dead ends: 1190 [2019-11-16 00:42:33,728 INFO L226 Difference]: Without dead ends: 722 [2019-11-16 00:42:33,729 INFO L600 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-11-16 00:42:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-16 00:42:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-16 00:42:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-16 00:42:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-16 00:42:33,752 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-16 00:42:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:33,752 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-16 00:42:33,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-16 00:42:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:42:33,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:33,754 INFO L380 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-11-16 00:42:33,754 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2019-11-16 00:42:33,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:33,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277811089] [2019-11-16 00:42:33,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:42:33,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277811089] [2019-11-16 00:42:33,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:33,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:33,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678745932] [2019-11-16 00:42:33,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:33,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:33,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:33,815 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-16 00:42:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:33,902 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-16 00:42:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:33,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-16 00:42:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:33,907 INFO L225 Difference]: With dead ends: 1656 [2019-11-16 00:42:33,907 INFO L226 Difference]: Without dead ends: 955 [2019-11-16 00:42:33,909 INFO L600 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-11-16 00:42:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-16 00:42:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-16 00:42:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-16 00:42:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-16 00:42:33,940 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-16 00:42:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:33,941 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-16 00:42:33,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-16 00:42:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:42:33,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:33,944 INFO L380 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-11-16 00:42:33,944 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2019-11-16 00:42:33,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:33,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628716383] [2019-11-16 00:42:33,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:42:34,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628716383] [2019-11-16 00:42:34,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:34,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:34,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723721255] [2019-11-16 00:42:34,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:34,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:34,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:34,009 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-16 00:42:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:34,081 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-16 00:42:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:34,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-16 00:42:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:34,088 INFO L225 Difference]: With dead ends: 2120 [2019-11-16 00:42:34,089 INFO L226 Difference]: Without dead ends: 1186 [2019-11-16 00:42:34,090 INFO L600 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-11-16 00:42:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-16 00:42:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-16 00:42:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-16 00:42:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-16 00:42:34,131 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-16 00:42:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:34,131 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-16 00:42:34,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-16 00:42:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-16 00:42:34,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:34,134 INFO L380 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-11-16 00:42:34,134 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-16 00:42:34,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:34,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150222857] [2019-11-16 00:42:34,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:42:34,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150222857] [2019-11-16 00:42:34,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:34,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:34,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9080976] [2019-11-16 00:42:34,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:34,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:34,207 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-16 00:42:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:34,276 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-16 00:42:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:34,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-16 00:42:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:34,284 INFO L225 Difference]: With dead ends: 1423 [2019-11-16 00:42:34,284 INFO L226 Difference]: Without dead ends: 1421 [2019-11-16 00:42:34,284 INFO L600 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-11-16 00:42:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-16 00:42:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-16 00:42:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-16 00:42:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-16 00:42:34,331 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-16 00:42:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:34,331 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-16 00:42:34,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-16 00:42:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:42:34,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:34,335 INFO L380 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] [2019-11-16 00:42:34,335 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-11-16 00:42:34,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:34,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968129796] [2019-11-16 00:42:34,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:42:34,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968129796] [2019-11-16 00:42:34,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:34,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:34,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041040565] [2019-11-16 00:42:34,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:34,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:34,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:34,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:34,419 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 4 states. [2019-11-16 00:42:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:34,898 INFO L93 Difference]: Finished difference Result 3197 states and 4729 transitions. [2019-11-16 00:42:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:34,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:42:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:34,908 INFO L225 Difference]: With dead ends: 3197 [2019-11-16 00:42:34,908 INFO L226 Difference]: Without dead ends: 1797 [2019-11-16 00:42:34,910 INFO L600 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-11-16 00:42:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-11-16 00:42:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1587. [2019-11-16 00:42:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-11-16 00:42:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2380 transitions. [2019-11-16 00:42:34,966 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2380 transitions. Word has length 163 [2019-11-16 00:42:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:34,966 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2380 transitions. [2019-11-16 00:42:34,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2380 transitions. [2019-11-16 00:42:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:42:34,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:34,970 INFO L380 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-11-16 00:42:34,971 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-16 00:42:34,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:34,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944543852] [2019-11-16 00:42:34,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:34,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:42:35,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944543852] [2019-11-16 00:42:35,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:35,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:35,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965197423] [2019-11-16 00:42:35,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:35,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:35,043 INFO L87 Difference]: Start difference. First operand 1587 states and 2380 transitions. Second operand 3 states. [2019-11-16 00:42:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:35,156 INFO L93 Difference]: Finished difference Result 2372 states and 3561 transitions. [2019-11-16 00:42:35,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:35,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-16 00:42:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:35,166 INFO L225 Difference]: With dead ends: 2372 [2019-11-16 00:42:35,166 INFO L226 Difference]: Without dead ends: 1848 [2019-11-16 00:42:35,167 INFO L600 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-11-16 00:42:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-11-16 00:42:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1848. [2019-11-16 00:42:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2775 transitions. [2019-11-16 00:42:35,227 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2775 transitions. Word has length 164 [2019-11-16 00:42:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:35,228 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2775 transitions. [2019-11-16 00:42:35,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2775 transitions. [2019-11-16 00:42:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-16 00:42:35,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:35,232 INFO L380 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] [2019-11-16 00:42:35,232 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2020286926, now seen corresponding path program 1 times [2019-11-16 00:42:35,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:35,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852500146] [2019-11-16 00:42:35,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:35,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852500146] [2019-11-16 00:42:35,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:35,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:35,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356605136] [2019-11-16 00:42:35,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:35,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:35,318 INFO L87 Difference]: Start difference. First operand 1848 states and 2775 transitions. Second operand 4 states. [2019-11-16 00:42:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:35,789 INFO L93 Difference]: Finished difference Result 3922 states and 5855 transitions. [2019-11-16 00:42:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:35,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-16 00:42:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:35,800 INFO L225 Difference]: With dead ends: 3922 [2019-11-16 00:42:35,801 INFO L226 Difference]: Without dead ends: 2093 [2019-11-16 00:42:35,804 INFO L600 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-11-16 00:42:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-16 00:42:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-16 00:42:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2768 transitions. [2019-11-16 00:42:35,864 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2768 transitions. Word has length 176 [2019-11-16 00:42:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:35,865 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2768 transitions. [2019-11-16 00:42:35,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2768 transitions. [2019-11-16 00:42:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:42:35,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:35,869 INFO L380 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] [2019-11-16 00:42:35,869 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 163592357, now seen corresponding path program 1 times [2019-11-16 00:42:35,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:35,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559510164] [2019-11-16 00:42:35,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:35,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559510164] [2019-11-16 00:42:35,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:35,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:35,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971076747] [2019-11-16 00:42:35,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:35,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:35,961 INFO L87 Difference]: Start difference. First operand 1848 states and 2768 transitions. Second operand 4 states. [2019-11-16 00:42:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:36,462 INFO L93 Difference]: Finished difference Result 3908 states and 5827 transitions. [2019-11-16 00:42:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:36,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-16 00:42:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:36,472 INFO L225 Difference]: With dead ends: 3908 [2019-11-16 00:42:36,473 INFO L226 Difference]: Without dead ends: 2079 [2019-11-16 00:42:36,476 INFO L600 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-11-16 00:42:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-16 00:42:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1848. [2019-11-16 00:42:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2761 transitions. [2019-11-16 00:42:36,534 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2761 transitions. Word has length 177 [2019-11-16 00:42:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:36,535 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2761 transitions. [2019-11-16 00:42:36,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2761 transitions. [2019-11-16 00:42:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:42:36,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:36,541 INFO L380 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] [2019-11-16 00:42:36,541 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-11-16 00:42:36,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:36,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813612856] [2019-11-16 00:42:36,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:36,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:36,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813612856] [2019-11-16 00:42:36,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:36,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:36,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495974042] [2019-11-16 00:42:36,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:36,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:36,623 INFO L87 Difference]: Start difference. First operand 1848 states and 2761 transitions. Second operand 4 states. [2019-11-16 00:42:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:37,119 INFO L93 Difference]: Finished difference Result 3901 states and 5806 transitions. [2019-11-16 00:42:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:37,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-16 00:42:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:37,130 INFO L225 Difference]: With dead ends: 3901 [2019-11-16 00:42:37,130 INFO L226 Difference]: Without dead ends: 2072 [2019-11-16 00:42:37,133 INFO L600 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-11-16 00:42:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-16 00:42:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-16 00:42:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2754 transitions. [2019-11-16 00:42:37,187 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2754 transitions. Word has length 177 [2019-11-16 00:42:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:37,187 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2754 transitions. [2019-11-16 00:42:37,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2754 transitions. [2019-11-16 00:42:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:42:37,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:37,191 INFO L380 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] [2019-11-16 00:42:37,192 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2019-11-16 00:42:37,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:37,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947216816] [2019-11-16 00:42:37,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:37,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947216816] [2019-11-16 00:42:37,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:37,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:37,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401955578] [2019-11-16 00:42:37,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:37,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:37,284 INFO L87 Difference]: Start difference. First operand 1848 states and 2754 transitions. Second operand 4 states. [2019-11-16 00:42:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:37,721 INFO L93 Difference]: Finished difference Result 3901 states and 5792 transitions. [2019-11-16 00:42:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:37,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-16 00:42:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:37,743 INFO L225 Difference]: With dead ends: 3901 [2019-11-16 00:42:37,748 INFO L226 Difference]: Without dead ends: 2072 [2019-11-16 00:42:37,751 INFO L600 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-11-16 00:42:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-16 00:42:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-16 00:42:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2747 transitions. [2019-11-16 00:42:37,815 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2747 transitions. Word has length 178 [2019-11-16 00:42:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:37,816 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2747 transitions. [2019-11-16 00:42:37,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2747 transitions. [2019-11-16 00:42:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:42:37,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:37,821 INFO L380 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] [2019-11-16 00:42:37,821 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2019-11-16 00:42:37,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:37,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660649783] [2019-11-16 00:42:37,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:37,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660649783] [2019-11-16 00:42:37,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:37,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:37,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205022597] [2019-11-16 00:42:37,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:37,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:37,952 INFO L87 Difference]: Start difference. First operand 1848 states and 2747 transitions. Second operand 4 states. [2019-11-16 00:42:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:38,358 INFO L93 Difference]: Finished difference Result 3901 states and 5778 transitions. [2019-11-16 00:42:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:38,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-16 00:42:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:38,363 INFO L225 Difference]: With dead ends: 3901 [2019-11-16 00:42:38,363 INFO L226 Difference]: Without dead ends: 2072 [2019-11-16 00:42:38,366 INFO L600 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-11-16 00:42:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-16 00:42:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-16 00:42:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2740 transitions. [2019-11-16 00:42:38,422 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2740 transitions. Word has length 179 [2019-11-16 00:42:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:38,422 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2740 transitions. [2019-11-16 00:42:38,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2740 transitions. [2019-11-16 00:42:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-16 00:42:38,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:38,427 INFO L380 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] [2019-11-16 00:42:38,427 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2019-11-16 00:42:38,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:38,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394214177] [2019-11-16 00:42:38,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:38,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394214177] [2019-11-16 00:42:38,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:38,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:38,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877030357] [2019-11-16 00:42:38,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:38,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:38,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:38,508 INFO L87 Difference]: Start difference. First operand 1848 states and 2740 transitions. Second operand 4 states. [2019-11-16 00:42:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:38,880 INFO L93 Difference]: Finished difference Result 3901 states and 5764 transitions. [2019-11-16 00:42:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:38,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-16 00:42:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:38,884 INFO L225 Difference]: With dead ends: 3901 [2019-11-16 00:42:38,885 INFO L226 Difference]: Without dead ends: 2072 [2019-11-16 00:42:38,887 INFO L600 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-11-16 00:42:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-16 00:42:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-16 00:42:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2733 transitions. [2019-11-16 00:42:38,964 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2733 transitions. Word has length 180 [2019-11-16 00:42:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:38,964 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2733 transitions. [2019-11-16 00:42:38,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2733 transitions. [2019-11-16 00:42:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:42:38,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:38,983 INFO L380 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] [2019-11-16 00:42:38,983 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2019-11-16 00:42:38,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:38,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122236175] [2019-11-16 00:42:38,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:39,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122236175] [2019-11-16 00:42:39,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:39,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:39,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95275477] [2019-11-16 00:42:39,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:39,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:39,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:39,063 INFO L87 Difference]: Start difference. First operand 1848 states and 2733 transitions. Second operand 4 states. [2019-11-16 00:42:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:39,391 INFO L93 Difference]: Finished difference Result 3831 states and 5666 transitions. [2019-11-16 00:42:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:39,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-16 00:42:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:39,395 INFO L225 Difference]: With dead ends: 3831 [2019-11-16 00:42:39,396 INFO L226 Difference]: Without dead ends: 2002 [2019-11-16 00:42:39,398 INFO L600 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-11-16 00:42:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-16 00:42:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-16 00:42:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2726 transitions. [2019-11-16 00:42:39,442 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2726 transitions. Word has length 181 [2019-11-16 00:42:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:39,442 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2726 transitions. [2019-11-16 00:42:39,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2726 transitions. [2019-11-16 00:42:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:42:39,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:39,446 INFO L380 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] [2019-11-16 00:42:39,446 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2019-11-16 00:42:39,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:39,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839854100] [2019-11-16 00:42:39,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:39,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839854100] [2019-11-16 00:42:39,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:39,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:39,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28764839] [2019-11-16 00:42:39,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:39,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:39,534 INFO L87 Difference]: Start difference. First operand 1848 states and 2726 transitions. Second operand 4 states. [2019-11-16 00:42:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:39,926 INFO L93 Difference]: Finished difference Result 3831 states and 5652 transitions. [2019-11-16 00:42:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:39,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-16 00:42:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:39,931 INFO L225 Difference]: With dead ends: 3831 [2019-11-16 00:42:39,932 INFO L226 Difference]: Without dead ends: 2002 [2019-11-16 00:42:39,934 INFO L600 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-11-16 00:42:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-16 00:42:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-16 00:42:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2719 transitions. [2019-11-16 00:42:39,979 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2719 transitions. Word has length 185 [2019-11-16 00:42:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:39,980 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2719 transitions. [2019-11-16 00:42:39,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2719 transitions. [2019-11-16 00:42:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:42:39,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:39,983 INFO L380 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] [2019-11-16 00:42:39,983 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2019-11-16 00:42:39,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:39,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456065561] [2019-11-16 00:42:39,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:40,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456065561] [2019-11-16 00:42:40,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:40,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:40,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497623603] [2019-11-16 00:42:40,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:40,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:40,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:40,145 INFO L87 Difference]: Start difference. First operand 1848 states and 2719 transitions. Second operand 4 states. [2019-11-16 00:42:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:40,571 INFO L93 Difference]: Finished difference Result 3831 states and 5638 transitions. [2019-11-16 00:42:40,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:40,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-16 00:42:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:40,575 INFO L225 Difference]: With dead ends: 3831 [2019-11-16 00:42:40,575 INFO L226 Difference]: Without dead ends: 2002 [2019-11-16 00:42:40,578 INFO L600 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-11-16 00:42:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-16 00:42:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-16 00:42:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2712 transitions. [2019-11-16 00:42:40,623 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2712 transitions. Word has length 185 [2019-11-16 00:42:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:40,623 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2712 transitions. [2019-11-16 00:42:40,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2712 transitions. [2019-11-16 00:42:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-16 00:42:40,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:40,627 INFO L380 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] [2019-11-16 00:42:40,627 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2019-11-16 00:42:40,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:40,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025311276] [2019-11-16 00:42:40,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:40,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:40,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025311276] [2019-11-16 00:42:40,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:40,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:40,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120491743] [2019-11-16 00:42:40,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:40,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:40,717 INFO L87 Difference]: Start difference. First operand 1848 states and 2712 transitions. Second operand 4 states. [2019-11-16 00:42:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,182 INFO L93 Difference]: Finished difference Result 3803 states and 5585 transitions. [2019-11-16 00:42:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-16 00:42:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,186 INFO L225 Difference]: With dead ends: 3803 [2019-11-16 00:42:41,186 INFO L226 Difference]: Without dead ends: 1974 [2019-11-16 00:42:41,188 INFO L600 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-11-16 00:42:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-16 00:42:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1848. [2019-11-16 00:42:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2705 transitions. [2019-11-16 00:42:41,231 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2705 transitions. Word has length 186 [2019-11-16 00:42:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,231 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2705 transitions. [2019-11-16 00:42:41,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2705 transitions. [2019-11-16 00:42:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-16 00:42:41,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,235 INFO L380 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] [2019-11-16 00:42:41,235 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2019-11-16 00:42:41,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625794323] [2019-11-16 00:42:41,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:42:41,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625794323] [2019-11-16 00:42:41,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:41,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89903214] [2019-11-16 00:42:41,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:41,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:41,316 INFO L87 Difference]: Start difference. First operand 1848 states and 2705 transitions. Second operand 4 states. [2019-11-16 00:42:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,752 INFO L93 Difference]: Finished difference Result 3768 states and 5525 transitions. [2019-11-16 00:42:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:41,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-16 00:42:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,756 INFO L225 Difference]: With dead ends: 3768 [2019-11-16 00:42:41,756 INFO L226 Difference]: Without dead ends: 1939 [2019-11-16 00:42:41,758 INFO L600 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-11-16 00:42:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-16 00:42:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1848. [2019-11-16 00:42:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-16 00:42:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2698 transitions. [2019-11-16 00:42:41,800 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2698 transitions. Word has length 186 [2019-11-16 00:42:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,800 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2698 transitions. [2019-11-16 00:42:41,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2698 transitions. [2019-11-16 00:42:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:42:41,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,804 INFO L380 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] [2019-11-16 00:42:41,804 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2019-11-16 00:42:41,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396753386] [2019-11-16 00:42:41,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:42:41,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396753386] [2019-11-16 00:42:41,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:41,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764758364] [2019-11-16 00:42:41,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:41,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:41,899 INFO L87 Difference]: Start difference. First operand 1848 states and 2698 transitions. Second operand 4 states. [2019-11-16 00:42:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:42,404 INFO L93 Difference]: Finished difference Result 4146 states and 6093 transitions. [2019-11-16 00:42:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:42,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-16 00:42:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:42,408 INFO L225 Difference]: With dead ends: 4146 [2019-11-16 00:42:42,408 INFO L226 Difference]: Without dead ends: 2317 [2019-11-16 00:42:42,411 INFO L600 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-11-16 00:42:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-16 00:42:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2058. [2019-11-16 00:42:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-11-16 00:42:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3069 transitions. [2019-11-16 00:42:42,458 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3069 transitions. Word has length 188 [2019-11-16 00:42:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:42,458 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3069 transitions. [2019-11-16 00:42:42,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3069 transitions. [2019-11-16 00:42:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-16 00:42:42,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:42,463 INFO L380 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] [2019-11-16 00:42:42,464 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1629892887, now seen corresponding path program 1 times [2019-11-16 00:42:42,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:42,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601748621] [2019-11-16 00:42:42,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:42,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601748621] [2019-11-16 00:42:42,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:42,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:42,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829875196] [2019-11-16 00:42:42,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:42,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:42,574 INFO L87 Difference]: Start difference. First operand 2058 states and 3069 transitions. Second operand 4 states. [2019-11-16 00:42:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:43,236 INFO L93 Difference]: Finished difference Result 4813 states and 7201 transitions. [2019-11-16 00:42:43,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:43,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-16 00:42:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:43,241 INFO L225 Difference]: With dead ends: 4813 [2019-11-16 00:42:43,242 INFO L226 Difference]: Without dead ends: 2774 [2019-11-16 00:42:43,244 INFO L600 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-11-16 00:42:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-11-16 00:42:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2254. [2019-11-16 00:42:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-16 00:42:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3412 transitions. [2019-11-16 00:42:43,376 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3412 transitions. Word has length 194 [2019-11-16 00:42:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:43,376 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 3412 transitions. [2019-11-16 00:42:43,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3412 transitions. [2019-11-16 00:42:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:42:43,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:43,381 INFO L380 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] [2019-11-16 00:42:43,381 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash -893401278, now seen corresponding path program 1 times [2019-11-16 00:42:43,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:43,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39692415] [2019-11-16 00:42:43,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:43,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:43,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:43,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39692415] [2019-11-16 00:42:43,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:43,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:43,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131635954] [2019-11-16 00:42:43,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:43,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:43,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:43,487 INFO L87 Difference]: Start difference. First operand 2254 states and 3412 transitions. Second operand 4 states. [2019-11-16 00:42:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:43,948 INFO L93 Difference]: Finished difference Result 4953 states and 7446 transitions. [2019-11-16 00:42:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:43,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-16 00:42:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:43,954 INFO L225 Difference]: With dead ends: 4953 [2019-11-16 00:42:43,954 INFO L226 Difference]: Without dead ends: 2718 [2019-11-16 00:42:43,957 INFO L600 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-11-16 00:42:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-11-16 00:42:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2261. [2019-11-16 00:42:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-11-16 00:42:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3419 transitions. [2019-11-16 00:42:44,009 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3419 transitions. Word has length 195 [2019-11-16 00:42:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:44,010 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 3419 transitions. [2019-11-16 00:42:44,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3419 transitions. [2019-11-16 00:42:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:42:44,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:44,014 INFO L380 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, 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] [2019-11-16 00:42:44,014 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1513066831, now seen corresponding path program 1 times [2019-11-16 00:42:44,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:44,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729850564] [2019-11-16 00:42:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:42:44,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729850564] [2019-11-16 00:42:44,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:44,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:42:44,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779605088] [2019-11-16 00:42:44,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:42:44,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:42:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:42:44,294 INFO L87 Difference]: Start difference. First operand 2261 states and 3419 transitions. Second operand 9 states. [2019-11-16 00:42:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:46,837 INFO L93 Difference]: Finished difference Result 9551 states and 14445 transitions. [2019-11-16 00:42:46,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:42:46,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-11-16 00:42:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:46,844 INFO L225 Difference]: With dead ends: 9551 [2019-11-16 00:42:46,844 INFO L226 Difference]: Without dead ends: 7309 [2019-11-16 00:42:46,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:42:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2019-11-16 00:42:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 3486. [2019-11-16 00:42:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-11-16 00:42:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5621 transitions. [2019-11-16 00:42:46,999 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5621 transitions. Word has length 199 [2019-11-16 00:42:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:46,999 INFO L462 AbstractCegarLoop]: Abstraction has 3486 states and 5621 transitions. [2019-11-16 00:42:47,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:42:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5621 transitions. [2019-11-16 00:42:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:42:47,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:47,005 INFO L380 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, 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] [2019-11-16 00:42:47,005 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1894677619, now seen corresponding path program 1 times [2019-11-16 00:42:47,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:47,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571841612] [2019-11-16 00:42:47,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:47,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:47,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:42:47,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571841612] [2019-11-16 00:42:47,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:47,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:42:47,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973752865] [2019-11-16 00:42:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:42:47,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:42:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:47,234 INFO L87 Difference]: Start difference. First operand 3486 states and 5621 transitions. Second operand 7 states. [2019-11-16 00:42:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:49,422 INFO L93 Difference]: Finished difference Result 11425 states and 18122 transitions. [2019-11-16 00:42:49,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:42:49,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-11-16 00:42:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:49,429 INFO L225 Difference]: With dead ends: 11425 [2019-11-16 00:42:49,430 INFO L226 Difference]: Without dead ends: 7958 [2019-11-16 00:42:49,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2019-11-16 00:42:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 4585. [2019-11-16 00:42:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4585 states. [2019-11-16 00:42:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 7582 transitions. [2019-11-16 00:42:49,568 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 7582 transitions. Word has length 199 [2019-11-16 00:42:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 4585 states and 7582 transitions. [2019-11-16 00:42:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:42:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 7582 transitions. [2019-11-16 00:42:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-16 00:42:49,575 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:49,575 INFO L380 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, 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] [2019-11-16 00:42:49,576 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash 940730833, now seen corresponding path program 1 times [2019-11-16 00:42:49,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:49,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823025130] [2019-11-16 00:42:49,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:49,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:49,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:42:49,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823025130] [2019-11-16 00:42:49,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:49,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:42:49,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667254528] [2019-11-16 00:42:49,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:49,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:49,805 INFO L87 Difference]: Start difference. First operand 4585 states and 7582 transitions. Second operand 8 states. [2019-11-16 00:42:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:51,321 INFO L93 Difference]: Finished difference Result 10823 states and 17497 transitions. [2019-11-16 00:42:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:42:51,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2019-11-16 00:42:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:51,326 INFO L225 Difference]: With dead ends: 10823 [2019-11-16 00:42:51,326 INFO L226 Difference]: Without dead ends: 6257 [2019-11-16 00:42:51,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:42:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2019-11-16 00:42:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 4053. [2019-11-16 00:42:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-11-16 00:42:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6647 transitions. [2019-11-16 00:42:51,428 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6647 transitions. Word has length 200 [2019-11-16 00:42:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:51,429 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 6647 transitions. [2019-11-16 00:42:51,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6647 transitions. [2019-11-16 00:42:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-16 00:42:51,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:51,435 INFO L380 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, 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] [2019-11-16 00:42:51,435 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1620132013, now seen corresponding path program 1 times [2019-11-16 00:42:51,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:51,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925387115] [2019-11-16 00:42:51,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:51,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:42:51,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925387115] [2019-11-16 00:42:51,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:51,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:42:51,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44211668] [2019-11-16 00:42:51,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:42:51,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:42:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:51,656 INFO L87 Difference]: Start difference. First operand 4053 states and 6647 transitions. Second operand 7 states. [2019-11-16 00:42:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:53,287 INFO L93 Difference]: Finished difference Result 11131 states and 17662 transitions. [2019-11-16 00:42:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:42:53,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-11-16 00:42:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:53,293 INFO L225 Difference]: With dead ends: 11131 [2019-11-16 00:42:53,293 INFO L226 Difference]: Without dead ends: 7097 [2019-11-16 00:42:53,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2019-11-16 00:42:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 4060. [2019-11-16 00:42:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6640 transitions. [2019-11-16 00:42:53,394 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6640 transitions. Word has length 200 [2019-11-16 00:42:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:53,394 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6640 transitions. [2019-11-16 00:42:53,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:42:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6640 transitions. [2019-11-16 00:42:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-16 00:42:53,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:53,399 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:42:53,399 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -606545911, now seen corresponding path program 1 times [2019-11-16 00:42:53,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:53,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786793158] [2019-11-16 00:42:53,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:53,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:53,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786793158] [2019-11-16 00:42:53,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:53,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:53,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607214076] [2019-11-16 00:42:53,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:53,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:53,505 INFO L87 Difference]: Start difference. First operand 4060 states and 6640 transitions. Second operand 4 states. [2019-11-16 00:42:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:54,117 INFO L93 Difference]: Finished difference Result 8530 states and 13842 transitions. [2019-11-16 00:42:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:54,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-16 00:42:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:54,121 INFO L225 Difference]: With dead ends: 8530 [2019-11-16 00:42:54,121 INFO L226 Difference]: Without dead ends: 4489 [2019-11-16 00:42:54,124 INFO L600 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-11-16 00:42:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-16 00:42:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4060. [2019-11-16 00:42:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6633 transitions. [2019-11-16 00:42:54,257 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6633 transitions. Word has length 207 [2019-11-16 00:42:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:54,258 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6633 transitions. [2019-11-16 00:42:54,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6633 transitions. [2019-11-16 00:42:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:42:54,262 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:54,262 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:42:54,263 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2073605104, now seen corresponding path program 1 times [2019-11-16 00:42:54,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:54,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600945116] [2019-11-16 00:42:54,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:54,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:54,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-16 00:42:54,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600945116] [2019-11-16 00:42:54,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:54,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:54,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971069468] [2019-11-16 00:42:54,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:54,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:54,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:54,373 INFO L87 Difference]: Start difference. First operand 4060 states and 6633 transitions. Second operand 4 states. [2019-11-16 00:42:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:54,939 INFO L93 Difference]: Finished difference Result 8381 states and 13613 transitions. [2019-11-16 00:42:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:54,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-16 00:42:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:54,942 INFO L225 Difference]: With dead ends: 8381 [2019-11-16 00:42:54,943 INFO L226 Difference]: Without dead ends: 4340 [2019-11-16 00:42:54,946 INFO L600 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-11-16 00:42:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2019-11-16 00:42:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4060. [2019-11-16 00:42:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6626 transitions. [2019-11-16 00:42:55,030 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6626 transitions. Word has length 208 [2019-11-16 00:42:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:55,030 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6626 transitions. [2019-11-16 00:42:55,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6626 transitions. [2019-11-16 00:42:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:42:55,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:55,035 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:55,035 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1533459632, now seen corresponding path program 1 times [2019-11-16 00:42:55,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:55,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783954402] [2019-11-16 00:42:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:55,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-16 00:42:55,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783954402] [2019-11-16 00:42:55,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:55,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:55,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457474641] [2019-11-16 00:42:55,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:55,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:55,137 INFO L87 Difference]: Start difference. First operand 4060 states and 6626 transitions. Second operand 4 states. [2019-11-16 00:42:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:55,726 INFO L93 Difference]: Finished difference Result 8635 states and 13948 transitions. [2019-11-16 00:42:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:55,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-16 00:42:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:55,729 INFO L225 Difference]: With dead ends: 8635 [2019-11-16 00:42:55,730 INFO L226 Difference]: Without dead ends: 4594 [2019-11-16 00:42:55,733 INFO L600 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-11-16 00:42:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-11-16 00:42:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4060. [2019-11-16 00:42:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6612 transitions. [2019-11-16 00:42:55,817 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6612 transitions. Word has length 208 [2019-11-16 00:42:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:55,817 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6612 transitions. [2019-11-16 00:42:55,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6612 transitions. [2019-11-16 00:42:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:42:55,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:55,822 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:42:55,822 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1763578117, now seen corresponding path program 1 times [2019-11-16 00:42:55,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:55,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277927189] [2019-11-16 00:42:55,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:55,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:55,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-16 00:42:55,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277927189] [2019-11-16 00:42:55,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:55,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:55,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278102735] [2019-11-16 00:42:55,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:55,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:55,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:55,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:55,927 INFO L87 Difference]: Start difference. First operand 4060 states and 6612 transitions. Second operand 4 states. [2019-11-16 00:42:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:56,354 INFO L93 Difference]: Finished difference Result 8325 states and 13480 transitions. [2019-11-16 00:42:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:56,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-16 00:42:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:56,359 INFO L225 Difference]: With dead ends: 8325 [2019-11-16 00:42:56,359 INFO L226 Difference]: Without dead ends: 4284 [2019-11-16 00:42:56,363 INFO L600 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-11-16 00:42:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2019-11-16 00:42:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4060. [2019-11-16 00:42:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6605 transitions. [2019-11-16 00:42:56,451 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6605 transitions. Word has length 209 [2019-11-16 00:42:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:56,451 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6605 transitions. [2019-11-16 00:42:56,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6605 transitions. [2019-11-16 00:42:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:42:56,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:56,455 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:56,455 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2096029627, now seen corresponding path program 1 times [2019-11-16 00:42:56,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:56,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522559004] [2019-11-16 00:42:56,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:56,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:56,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-16 00:42:56,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522559004] [2019-11-16 00:42:56,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:56,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:56,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615429376] [2019-11-16 00:42:56,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:56,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:56,566 INFO L87 Difference]: Start difference. First operand 4060 states and 6605 transitions. Second operand 4 states. [2019-11-16 00:42:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:57,094 INFO L93 Difference]: Finished difference Result 8579 states and 13815 transitions. [2019-11-16 00:42:57,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:57,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-16 00:42:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:57,097 INFO L225 Difference]: With dead ends: 8579 [2019-11-16 00:42:57,098 INFO L226 Difference]: Without dead ends: 4538 [2019-11-16 00:42:57,099 INFO L600 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-11-16 00:42:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2019-11-16 00:42:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 4060. [2019-11-16 00:42:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6591 transitions. [2019-11-16 00:42:57,188 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6591 transitions. Word has length 209 [2019-11-16 00:42:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:57,188 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6591 transitions. [2019-11-16 00:42:57,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6591 transitions. [2019-11-16 00:42:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:42:57,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:57,193 INFO L380 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] [2019-11-16 00:42:57,193 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1669270075, now seen corresponding path program 1 times [2019-11-16 00:42:57,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:57,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696733497] [2019-11-16 00:42:57,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:57,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:57,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696733497] [2019-11-16 00:42:57,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:57,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:57,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781288362] [2019-11-16 00:42:57,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:57,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:57,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:57,300 INFO L87 Difference]: Start difference. First operand 4060 states and 6591 transitions. Second operand 4 states. [2019-11-16 00:42:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:57,823 INFO L93 Difference]: Finished difference Result 8530 states and 13744 transitions. [2019-11-16 00:42:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:57,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-16 00:42:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:57,826 INFO L225 Difference]: With dead ends: 8530 [2019-11-16 00:42:57,827 INFO L226 Difference]: Without dead ends: 4489 [2019-11-16 00:42:57,829 INFO L600 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-11-16 00:42:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-16 00:42:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4060. [2019-11-16 00:42:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6584 transitions. [2019-11-16 00:42:57,944 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6584 transitions. Word has length 209 [2019-11-16 00:42:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:57,944 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6584 transitions. [2019-11-16 00:42:57,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6584 transitions. [2019-11-16 00:42:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:42:57,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:57,947 INFO L380 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] [2019-11-16 00:42:57,947 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash -534944436, now seen corresponding path program 1 times [2019-11-16 00:42:57,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:57,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200538862] [2019-11-16 00:42:57,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:57,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:57,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:58,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200538862] [2019-11-16 00:42:58,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:58,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:58,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969115357] [2019-11-16 00:42:58,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:58,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:58,057 INFO L87 Difference]: Start difference. First operand 4060 states and 6584 transitions. Second operand 4 states. [2019-11-16 00:42:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:58,547 INFO L93 Difference]: Finished difference Result 8530 states and 13730 transitions. [2019-11-16 00:42:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:58,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-16 00:42:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:58,552 INFO L225 Difference]: With dead ends: 8530 [2019-11-16 00:42:58,552 INFO L226 Difference]: Without dead ends: 4489 [2019-11-16 00:42:58,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-16 00:42:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4060. [2019-11-16 00:42:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6577 transitions. [2019-11-16 00:42:58,654 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6577 transitions. Word has length 210 [2019-11-16 00:42:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:58,654 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6577 transitions. [2019-11-16 00:42:58,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6577 transitions. [2019-11-16 00:42:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-16 00:42:58,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:58,657 INFO L380 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] [2019-11-16 00:42:58,657 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1012622592, now seen corresponding path program 1 times [2019-11-16 00:42:58,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:58,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660443926] [2019-11-16 00:42:58,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:58,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:58,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:58,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660443926] [2019-11-16 00:42:58,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:58,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:58,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265288474] [2019-11-16 00:42:58,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:58,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:58,763 INFO L87 Difference]: Start difference. First operand 4060 states and 6577 transitions. Second operand 4 states. [2019-11-16 00:42:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:59,194 INFO L93 Difference]: Finished difference Result 8530 states and 13716 transitions. [2019-11-16 00:42:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:59,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-16 00:42:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:59,198 INFO L225 Difference]: With dead ends: 8530 [2019-11-16 00:42:59,198 INFO L226 Difference]: Without dead ends: 4489 [2019-11-16 00:42:59,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-16 00:42:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4060. [2019-11-16 00:42:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:42:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6570 transitions. [2019-11-16 00:42:59,306 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6570 transitions. Word has length 211 [2019-11-16 00:42:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:59,306 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6570 transitions. [2019-11-16 00:42:59,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6570 transitions. [2019-11-16 00:42:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-16 00:42:59,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:59,309 INFO L380 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] [2019-11-16 00:42:59,309 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash 77189159, now seen corresponding path program 1 times [2019-11-16 00:42:59,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:59,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324195071] [2019-11-16 00:42:59,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:59,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-16 00:42:59,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324195071] [2019-11-16 00:42:59,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:59,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:59,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847941819] [2019-11-16 00:42:59,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:59,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:59,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:59,408 INFO L87 Difference]: Start difference. First operand 4060 states and 6570 transitions. Second operand 4 states. [2019-11-16 00:42:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:59,997 INFO L93 Difference]: Finished difference Result 8460 states and 13618 transitions. [2019-11-16 00:42:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:59,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-16 00:42:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:00,001 INFO L225 Difference]: With dead ends: 8460 [2019-11-16 00:43:00,001 INFO L226 Difference]: Without dead ends: 4419 [2019-11-16 00:43:00,003 INFO L600 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-11-16 00:43:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-11-16 00:43:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 4060. [2019-11-16 00:43:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-16 00:43:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6563 transitions. [2019-11-16 00:43:00,118 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6563 transitions. Word has length 212 [2019-11-16 00:43:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:00,118 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6563 transitions. [2019-11-16 00:43:00,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6563 transitions. [2019-11-16 00:43:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-16 00:43:00,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:00,123 INFO L380 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, 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] [2019-11-16 00:43:00,123 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash -11911447, now seen corresponding path program 1 times [2019-11-16 00:43:00,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:00,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718164009] [2019-11-16 00:43:00,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:00,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:00,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-16 00:43:00,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718164009] [2019-11-16 00:43:00,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:00,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:43:00,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609077586] [2019-11-16 00:43:00,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:43:00,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:43:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:43:00,246 INFO L87 Difference]: Start difference. First operand 4060 states and 6563 transitions. Second operand 5 states. [2019-11-16 00:43:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:00,784 INFO L93 Difference]: Finished difference Result 8985 states and 14433 transitions. [2019-11-16 00:43:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:00,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-11-16 00:43:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:00,788 INFO L225 Difference]: With dead ends: 8985 [2019-11-16 00:43:00,788 INFO L226 Difference]: Without dead ends: 4944 [2019-11-16 00:43:00,791 INFO L600 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-11-16 00:43:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-11-16 00:43:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4319. [2019-11-16 00:43:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-11-16 00:43:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 7025 transitions. [2019-11-16 00:43:00,890 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 7025 transitions. Word has length 214 [2019-11-16 00:43:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 4319 states and 7025 transitions. [2019-11-16 00:43:00,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:43:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 7025 transitions. [2019-11-16 00:43:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-16 00:43:00,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:00,893 INFO L380 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, 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] [2019-11-16 00:43:00,893 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 911044471, now seen corresponding path program 1 times [2019-11-16 00:43:00,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:00,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819594057] [2019-11-16 00:43:00,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:00,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:00,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-16 00:43:01,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819594057] [2019-11-16 00:43:01,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:01,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:43:01,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238502831] [2019-11-16 00:43:01,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:43:01,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:01,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:43:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:43:01,028 INFO L87 Difference]: Start difference. First operand 4319 states and 7025 transitions. Second operand 5 states. [2019-11-16 00:43:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:01,594 INFO L93 Difference]: Finished difference Result 9230 states and 14860 transitions. [2019-11-16 00:43:01,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:01,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2019-11-16 00:43:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:01,599 INFO L225 Difference]: With dead ends: 9230 [2019-11-16 00:43:01,599 INFO L226 Difference]: Without dead ends: 4930 [2019-11-16 00:43:01,603 INFO L600 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-11-16 00:43:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4930 states. [2019-11-16 00:43:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4930 to 4256. [2019-11-16 00:43:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4256 states. [2019-11-16 00:43:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 6899 transitions. [2019-11-16 00:43:01,717 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 6899 transitions. Word has length 215 [2019-11-16 00:43:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:01,717 INFO L462 AbstractCegarLoop]: Abstraction has 4256 states and 6899 transitions. [2019-11-16 00:43:01,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:43:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 6899 transitions. [2019-11-16 00:43:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-16 00:43:01,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:01,720 INFO L380 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, 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-11-16 00:43:01,720 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1214559478, now seen corresponding path program 1 times [2019-11-16 00:43:01,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:01,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043652060] [2019-11-16 00:43:01,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:01,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:01,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 151 proven. 297 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:43:02,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043652060] [2019-11-16 00:43:02,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995575686] [2019-11-16 00:43:02,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:02,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:43:02,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:02,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:43:02,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:02,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,776 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-16 00:43:02,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:02,832 INFO L375 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-11-16 00:43:02,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:02,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,857 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:02,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,958 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:02,958 INFO L375 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 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-16 00:43:02,959 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:02,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,977 INFO L496 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-11-16 00:43:02,977 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-16 00:43:03,051 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:03,052 INFO L375 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-11-16 00:43:03,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:03,109 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:03,109 INFO L375 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-11-16 00:43:03,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:03,127 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-16 00:43:03,130 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:03,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,202 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:03,203 INFO L375 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-11-16 00:43:03,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:43:03,262 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:03,262 INFO L375 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-11-16 00:43:03,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:03,316 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:03,317 INFO L375 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-11-16 00:43:03,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:03,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:03,347 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-16 00:43:03,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:03,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:43:03,353 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:03,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:03,530 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-16 00:43:03,531 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-16 00:43:03,531 INFO L375 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-11-16 00:43:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:03,565 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:03,679 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-11-16 00:43:03,680 INFO L567 ElimStorePlain]: treesize reduction 328, result has 32.9 percent of original size [2019-11-16 00:43:03,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:03,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:179 [2019-11-16 00:43:03,774 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-16 00:43:03,777 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:03,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,027 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-16 00:43:04,027 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-16 00:43:04,028 INFO L375 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-11-16 00:43:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,075 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-16 00:43:04,076 INFO L496 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-11-16 00:43:04,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-16 00:43:04,241 INFO L341 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-16 00:43:04,241 INFO L375 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 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-16 00:43:04,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,264 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-16 00:43:04,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:04,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-16 00:43:04,294 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_159|], 30=[|v_#memory_$Pointer$.base_171|]} [2019-11-16 00:43:04,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-16 00:43:04,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-16 00:43:04,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,670 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-16 00:43:04,670 INFO L341 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-16 00:43:04,671 INFO L375 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 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-16 00:43:04,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:04,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:05,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:06,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:06,281 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 23 xjuncts. [2019-11-16 00:43:10,365 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 729 DAG size of output: 49 [2019-11-16 00:43:10,366 INFO L567 ElimStorePlain]: treesize reduction 273424, result has 0.1 percent of original size [2019-11-16 00:43:10,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:43:10,367 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:176 [2019-11-16 00:43:10,446 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_179|, |v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-16 00:43:10,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-16 00:43:10,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-16 00:43:10,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,530 INFO L375 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 93 treesize of output 59 [2019-11-16 00:43:10,530 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,548 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-16 00:43:10,605 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_173|, |v_#memory_int_180|]} [2019-11-16 00:43:10,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-11-16 00:43:10,609 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:10,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:10,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-16 00:43:10,644 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:10,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,672 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:43:10,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2019-11-16 00:43:10,672 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:10,681 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:32 [2019-11-16 00:43:10,742 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:10,743 INFO L375 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-11-16 00:43:10,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:10,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-16 00:43:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 274 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:43:11,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:11,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-11-16 00:43:11,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136682438] [2019-11-16 00:43:11,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:43:11,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:43:11,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:43:11,225 INFO L87 Difference]: Start difference. First operand 4256 states and 6899 transitions. Second operand 16 states. [2019-11-16 00:43:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:18,789 INFO L93 Difference]: Finished difference Result 24344 states and 38113 transitions. [2019-11-16 00:43:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:43:18,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 228 [2019-11-16 00:43:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:18,837 INFO L225 Difference]: With dead ends: 24344 [2019-11-16 00:43:18,837 INFO L226 Difference]: Without dead ends: 20107 [2019-11-16 00:43:18,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:43:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20107 states. [2019-11-16 00:43:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20107 to 10864. [2019-11-16 00:43:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10864 states. [2019-11-16 00:43:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 17587 transitions. [2019-11-16 00:43:19,323 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 17587 transitions. Word has length 228 [2019-11-16 00:43:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:19,323 INFO L462 AbstractCegarLoop]: Abstraction has 10864 states and 17587 transitions. [2019-11-16 00:43:19,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:43:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 17587 transitions. [2019-11-16 00:43:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-16 00:43:19,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:19,345 INFO L380 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, 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-11-16 00:43:19,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:19,550 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1047013772, now seen corresponding path program 1 times [2019-11-16 00:43:19,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:19,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178957259] [2019-11-16 00:43:19,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:19,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:19,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 270 proven. 92 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:43:20,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178957259] [2019-11-16 00:43:20,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132412318] [2019-11-16 00:43:20,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:20,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:43:20,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:20,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:43:20,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,452 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.base_174|]} [2019-11-16 00:43:20,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,501 INFO L375 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-11-16 00:43:20,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,545 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:20,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,641 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:20,641 INFO L375 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 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-16 00:43:20,642 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,663 INFO L496 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-11-16 00:43:20,663 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-16 00:43:20,726 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:20,726 INFO L375 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-11-16 00:43:20,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:20,788 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:20,789 INFO L375 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-11-16 00:43:20,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:20,805 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-11-16 00:43:20,807 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:20,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,884 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:20,885 INFO L375 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-11-16 00:43:20,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:43:20,936 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_181|], 12=[|v_#memory_$Pointer$.base_181|]} [2019-11-16 00:43:20,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-16 00:43:20,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,989 INFO L375 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 72 treesize of output 44 [2019-11-16 00:43:20,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2019-11-16 00:43:21,036 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_182|], 12=[|v_#memory_$Pointer$.base_182|]} [2019-11-16 00:43:21,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,047 INFO L375 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 33 treesize of output 35 [2019-11-16 00:43:21,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,090 INFO L375 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 72 treesize of output 44 [2019-11-16 00:43:21,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:81 [2019-11-16 00:43:21,154 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_183|], 12=[|v_#memory_int_183|]} [2019-11-16 00:43:21,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:43:21,160 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:21,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 36 [2019-11-16 00:43:21,200 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:21,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,227 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-16 00:43:21,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2019-11-16 00:43:21,228 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,237 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:29 [2019-11-16 00:43:21,300 INFO L341 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2019-11-16 00:43:21,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2019-11-16 00:43:21,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:29 [2019-11-16 00:43:21,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-16 00:43:21,356 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-16 00:43:21,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2019-11-16 00:43:21,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:21,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:21,366 INFO L567 ElimStorePlain]: treesize reduction 21, result has 16.0 percent of original size [2019-11-16 00:43:21,366 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:4 [2019-11-16 00:43:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 298 proven. 64 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:43:21,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:21,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-16 00:43:21,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772616074] [2019-11-16 00:43:21,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:43:21,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:43:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:21,612 INFO L87 Difference]: Start difference. First operand 10864 states and 17587 transitions. Second operand 14 states. [2019-11-16 00:43:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:25,311 INFO L93 Difference]: Finished difference Result 29499 states and 47352 transitions. [2019-11-16 00:43:25,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:43:25,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2019-11-16 00:43:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:25,355 INFO L225 Difference]: With dead ends: 29499 [2019-11-16 00:43:25,356 INFO L226 Difference]: Without dead ends: 18654 [2019-11-16 00:43:25,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:43:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18654 states. [2019-11-16 00:43:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18654 to 16261. [2019-11-16 00:43:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-11-16 00:43:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 26279 transitions. [2019-11-16 00:43:25,911 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 26279 transitions. Word has length 228 [2019-11-16 00:43:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:25,911 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 26279 transitions. [2019-11-16 00:43:25,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:43:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 26279 transitions. [2019-11-16 00:43:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-16 00:43:25,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:25,926 INFO L380 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, 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-11-16 00:43:26,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:26,130 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:26,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:26,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2011306122, now seen corresponding path program 1 times [2019-11-16 00:43:26,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:26,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643533414] [2019-11-16 00:43:26,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:26,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:26,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 154 proven. 297 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:43:26,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643533414] [2019-11-16 00:43:26,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704662952] [2019-11-16 00:43:26,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:26,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:43:26,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:27,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:43:27,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,111 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_188|], 2=[|v_#memory_$Pointer$.base_185|, |v_#memory_$Pointer$.base_184|]} [2019-11-16 00:43:27,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,150 INFO L375 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-11-16 00:43:27,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,175 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,240 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:27,240 INFO L375 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 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-16 00:43:27,240 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,255 INFO L496 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-11-16 00:43:27,255 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-16 00:43:27,303 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:27,303 INFO L375 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-11-16 00:43:27,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:27,340 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:27,340 INFO L375 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-11-16 00:43:27,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:27,358 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_186|], 12=[|v_#memory_$Pointer$.base_191|]} [2019-11-16 00:43:27,360 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,419 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:43:27,420 INFO L375 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-11-16 00:43:27,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:43:27,484 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:27,484 INFO L375 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-11-16 00:43:27,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:27,540 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:43:27,541 INFO L375 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-11-16 00:43:27,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:27,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:43:27,553 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|], 20=[|v_#memory_$Pointer$.base_194|]} [2019-11-16 00:43:27,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:27,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:43:27,557 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,749 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-16 00:43:27,749 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-16 00:43:27,749 INFO L375 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-11-16 00:43:27,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:27,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 26 xjuncts. [2019-11-16 00:43:28,205 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 33 [2019-11-16 00:43:28,206 INFO L567 ElimStorePlain]: treesize reduction 7750, result has 1.0 percent of original size [2019-11-16 00:43:28,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:28,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2019-11-16 00:43:28,239 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 30=[|v_#memory_$Pointer$.base_195|]} [2019-11-16 00:43:28,242 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:28,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:28,413 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-16 00:43:28,414 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-16 00:43:28,414 INFO L375 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-11-16 00:43:28,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:28,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:28,444 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-16 00:43:28,444 INFO L496 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-11-16 00:43:28,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-16 00:43:28,608 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 52 [2019-11-16 00:43:28,608 INFO L341 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-16 00:43:28,609 INFO L375 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 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-16 00:43:28,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:28,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:28,641 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-16 00:43:28,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:28,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-16 00:43:28,746 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_186|], 2=[|v_#memory_$Pointer$.offset_164|], 30=[|v_#memory_$Pointer$.base_197|]} [2019-11-16 00:43:28,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-16 00:43:28,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:28,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:28,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-16 00:43:28,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:28,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:29,110 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-16 00:43:29,111 INFO L341 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-16 00:43:29,111 INFO L375 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 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-16 00:43:29,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:29,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:29,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:30,389 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:35,399 WARN L191 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 1037 DAG size of output: 52 [2019-11-16 00:43:35,400 INFO L567 ElimStorePlain]: treesize reduction 225986, result has 0.1 percent of original size [2019-11-16 00:43:35,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:43:35,401 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:224 [2019-11-16 00:43:35,472 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_187|, |v_#memory_$Pointer$.offset_165|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-11-16 00:43:35,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-16 00:43:35,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-16 00:43:35,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,524 INFO L375 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 93 treesize of output 59 [2019-11-16 00:43:35,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,536 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-16 00:43:35,572 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|], 6=[|v_#memory_$Pointer$.base_199|, |v_#memory_int_188|]} [2019-11-16 00:43:35,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-11-16 00:43:35,582 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-16 00:43:35,613 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,636 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:43:35,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2019-11-16 00:43:35,637 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,654 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:38 [2019-11-16 00:43:35,709 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:35,709 INFO L375 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 43 treesize of output 13 [2019-11-16 00:43:35,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2019-11-16 00:43:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 275 proven. 148 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:43:36,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:36,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-16 00:43:36,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916754258] [2019-11-16 00:43:36,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:43:36,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:36,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:43:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:43:36,150 INFO L87 Difference]: Start difference. First operand 16261 states and 26279 transitions. Second operand 15 states. [2019-11-16 00:43:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:44,433 INFO L93 Difference]: Finished difference Result 45548 states and 72271 transitions. [2019-11-16 00:43:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:43:44,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 229 [2019-11-16 00:43:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:44,463 INFO L225 Difference]: With dead ends: 45548 [2019-11-16 00:43:44,463 INFO L226 Difference]: Without dead ends: 29306 [2019-11-16 00:43:44,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:43:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29306 states. [2019-11-16 00:43:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29306 to 16135. [2019-11-16 00:43:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16135 states. [2019-11-16 00:43:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16135 states to 16135 states and 26041 transitions. [2019-11-16 00:43:45,087 INFO L78 Accepts]: Start accepts. Automaton has 16135 states and 26041 transitions. Word has length 229 [2019-11-16 00:43:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:45,087 INFO L462 AbstractCegarLoop]: Abstraction has 16135 states and 26041 transitions. [2019-11-16 00:43:45,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:43:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16135 states and 26041 transitions. [2019-11-16 00:43:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-16 00:43:45,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:45,102 INFO L380 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, 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] [2019-11-16 00:43:45,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:45,308 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:45,308 INFO L82 PathProgramCache]: Analyzing trace with hash 408818485, now seen corresponding path program 1 times [2019-11-16 00:43:45,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:45,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565857454] [2019-11-16 00:43:45,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:45,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:45,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-16 00:43:45,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565857454] [2019-11-16 00:43:45,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646850070] [2019-11-16 00:43:45,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:45,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:43:45,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:45,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:43:45,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:43:45,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_200|, |v_#memory_$Pointer$.offset_167|], 2=[|v_#memory_int_190|]} [2019-11-16 00:43:45,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-16 00:43:45,902 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:45,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-11-16 00:43:45,913 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:45,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-16 00:43:45,947 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,979 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-16 00:43:45,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:45,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:45,980 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-16 00:43:45,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:46,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:46,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:46,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:46,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-16 00:43:46,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:46,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:46,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:43:46,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:46,094 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-16 00:43:46,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:46,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-16 00:43:46,190 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:46,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:46,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:46,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:46,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:46,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:43:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-16 00:43:46,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:46,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2019-11-16 00:43:46,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478470653] [2019-11-16 00:43:46,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:43:46,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:46,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:43:46,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:46,247 INFO L87 Difference]: Start difference. First operand 16135 states and 26041 transitions. Second operand 8 states. [2019-11-16 00:43:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:48,560 INFO L93 Difference]: Finished difference Result 35417 states and 56526 transitions. [2019-11-16 00:43:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:43:48,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 231 [2019-11-16 00:43:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:48,578 INFO L225 Difference]: With dead ends: 35417 [2019-11-16 00:43:48,578 INFO L226 Difference]: Without dead ends: 19301 [2019-11-16 00:43:48,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:43:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19301 states. [2019-11-16 00:43:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19301 to 16730. [2019-11-16 00:43:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16730 states. [2019-11-16 00:43:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16730 states to 16730 states and 27063 transitions. [2019-11-16 00:43:49,163 INFO L78 Accepts]: Start accepts. Automaton has 16730 states and 27063 transitions. Word has length 231 [2019-11-16 00:43:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:49,163 INFO L462 AbstractCegarLoop]: Abstraction has 16730 states and 27063 transitions. [2019-11-16 00:43:49,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:43:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16730 states and 27063 transitions. [2019-11-16 00:43:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-16 00:43:49,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:49,174 INFO L380 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, 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] [2019-11-16 00:43:49,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:49,374 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1962803991, now seen corresponding path program 1 times [2019-11-16 00:43:49,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:49,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537071202] [2019-11-16 00:43:49,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:49,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:49,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 340 proven. 1 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-11-16 00:43:49,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537071202] [2019-11-16 00:43:49,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848578001] [2019-11-16 00:43:49,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:43:49,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:49,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:43:49,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:49,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:49,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:49,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:43:49,886 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_168|, |v_#memory_$Pointer$.base_201|], 2=[|v_#memory_int_193|]} [2019-11-16 00:43:49,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-16 00:43:49,889 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:49,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:49,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:43:49,902 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:49,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:49,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:49,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-16 00:43:49,928 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:49,964 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-16 00:43:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:49,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:49,965 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-16 00:43:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:49,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:49,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:50,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:43:50,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:50,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:50,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:50,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-16 00:43:50,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:50,094 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-16 00:43:50,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:50,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-16 00:43:50,236 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:50,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:50,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:50,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:50,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:50,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:43:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-16 00:43:50,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:50,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2019-11-16 00:43:50,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085156684] [2019-11-16 00:43:50,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:43:50,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:43:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:50,312 INFO L87 Difference]: Start difference. First operand 16730 states and 27063 transitions. Second operand 8 states. [2019-11-16 00:43:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:52,891 INFO L93 Difference]: Finished difference Result 35942 states and 57394 transitions. [2019-11-16 00:43:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:43:52,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-11-16 00:43:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:52,907 INFO L225 Difference]: With dead ends: 35942 [2019-11-16 00:43:52,907 INFO L226 Difference]: Without dead ends: 19231 [2019-11-16 00:43:52,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:43:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-11-16 00:43:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 16758. [2019-11-16 00:43:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16758 states. [2019-11-16 00:43:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16758 states to 16758 states and 27070 transitions. [2019-11-16 00:43:53,462 INFO L78 Accepts]: Start accepts. Automaton has 16758 states and 27070 transitions. Word has length 232 [2019-11-16 00:43:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:53,462 INFO L462 AbstractCegarLoop]: Abstraction has 16758 states and 27070 transitions. [2019-11-16 00:43:53,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:43:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 16758 states and 27070 transitions. [2019-11-16 00:43:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-16 00:43:53,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:53,474 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2019-11-16 00:43:53,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:53,674 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1687624652, now seen corresponding path program 1 times [2019-11-16 00:43:53,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:53,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351161593] [2019-11-16 00:43:53,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:53,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:53,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 360 proven. 37 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:43:53,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351161593] [2019-11-16 00:43:53,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982368146] [2019-11-16 00:43:53,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:54,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:43:54,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:54,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:43:54,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:43:54,236 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_204|, |v_#memory_$Pointer$.offset_171|], 2=[|v_#memory_int_196|]} [2019-11-16 00:43:54,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-16 00:43:54,240 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:54,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-11-16 00:43:54,255 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:54,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-16 00:43:54,289 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,319 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-16 00:43:54,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:54,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:54,320 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-16 00:43:54,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:54,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:54,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:54,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:43:54,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:54,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-16 00:43:54,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,464 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-16 00:43:54,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:54,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-16 00:43:54,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:54,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:54,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:54,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,514 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:54,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:54,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:54,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:54,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:54,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:7 [2019-11-16 00:43:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-16 00:43:54,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:54,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-16 00:43:54,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965337198] [2019-11-16 00:43:54,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:43:54,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:43:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:43:54,573 INFO L87 Difference]: Start difference. First operand 16758 states and 27070 transitions. Second operand 6 states. [2019-11-16 00:43:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:57,069 INFO L93 Difference]: Finished difference Result 36336 states and 57871 transitions. [2019-11-16 00:43:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:43:57,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-11-16 00:43:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:57,084 INFO L225 Difference]: With dead ends: 36336 [2019-11-16 00:43:57,084 INFO L226 Difference]: Without dead ends: 19597 [2019-11-16 00:43:57,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:43:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2019-11-16 00:43:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 16758. [2019-11-16 00:43:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16758 states. [2019-11-16 00:43:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16758 states to 16758 states and 27028 transitions. [2019-11-16 00:43:57,676 INFO L78 Accepts]: Start accepts. Automaton has 16758 states and 27028 transitions. Word has length 241 [2019-11-16 00:43:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:57,676 INFO L462 AbstractCegarLoop]: Abstraction has 16758 states and 27028 transitions. [2019-11-16 00:43:57,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:43:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16758 states and 27028 transitions. [2019-11-16 00:43:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-16 00:43:57,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:57,688 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2019-11-16 00:43:57,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:57,889 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1266982991, now seen corresponding path program 1 times [2019-11-16 00:43:57,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:57,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151453197] [2019-11-16 00:43:57,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:57,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:57,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 366 proven. 35 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-16 00:43:58,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151453197] [2019-11-16 00:43:58,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103947095] [2019-11-16 00:43:58,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:58,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:43:58,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:58,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:43:58,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:43:58,393 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_174|, |v_#memory_$Pointer$.base_207|], 2=[|v_#memory_int_199|]} [2019-11-16 00:43:58,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-16 00:43:58,396 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:43:58,404 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-16 00:43:58,423 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,442 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-16 00:43:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:58,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,443 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-16 00:43:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:58,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:58,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-16 00:43:58,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:43:58,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,560 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-11-16 00:43:58,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:58,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-16 00:43:58,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:58,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:58,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,592 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:43:58,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-16 00:43:58,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:43:58,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:7 [2019-11-16 00:43:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-16 00:43:58,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:58,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-16 00:43:58,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176014779] [2019-11-16 00:43:58,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:43:58,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:43:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:43:58,635 INFO L87 Difference]: Start difference. First operand 16758 states and 27028 transitions. Second operand 6 states. [2019-11-16 00:44:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:00,903 INFO L93 Difference]: Finished difference Result 36231 states and 57682 transitions. [2019-11-16 00:44:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:44:00,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-11-16 00:44:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:00,921 INFO L225 Difference]: With dead ends: 36231 [2019-11-16 00:44:00,921 INFO L226 Difference]: Without dead ends: 19492 [2019-11-16 00:44:00,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:44:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19492 states. [2019-11-16 00:44:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19492 to 16758. [2019-11-16 00:44:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16758 states. [2019-11-16 00:44:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16758 states to 16758 states and 26951 transitions. [2019-11-16 00:44:01,671 INFO L78 Accepts]: Start accepts. Automaton has 16758 states and 26951 transitions. Word has length 242 [2019-11-16 00:44:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:01,671 INFO L462 AbstractCegarLoop]: Abstraction has 16758 states and 26951 transitions. [2019-11-16 00:44:01,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:44:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 16758 states and 26951 transitions. [2019-11-16 00:44:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-16 00:44:01,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:01,683 INFO L380 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, 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] [2019-11-16 00:44:01,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:01,884 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1197802576, now seen corresponding path program 1 times [2019-11-16 00:44:01,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665653136] [2019-11-16 00:44:01,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 336 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-16 00:44:02,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665653136] [2019-11-16 00:44:02,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269938027] [2019-11-16 00:44:02,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:44:02,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:02,373 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_175|, |v_#memory_$Pointer$.base_208|], 5=[|v_#memory_int_201|]} [2019-11-16 00:44:02,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-11-16 00:44:02,378 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:02,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-11-16 00:44:02,384 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-16 00:44:02,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:02,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:02,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:02,650 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:44:02,654 INFO L168 Benchmark]: Toolchain (without parser) took 110273.11 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 939.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 594.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,654 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:02,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,655 INFO L168 Benchmark]: Boogie Preprocessor took 136.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,656 INFO L168 Benchmark]: RCFGBuilder took 1115.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,662 INFO L168 Benchmark]: TraceAbstraction took 108010.08 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 974.7 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 512.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:02,663 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 890.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 136.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1115.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108010.08 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 974.7 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 512.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:04,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:04,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:04,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:04,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:04,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:04,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:04,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:05,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:05,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:05,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:05,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:05,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:05,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:05,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:05,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:05,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:05,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:05,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:05,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:05,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:05,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:05,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:05,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:05,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:05,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:05,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:05,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:05,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:05,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:05,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:05,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:05,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:05,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:05,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:05,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:05,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:05,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:05,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:05,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:05,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:05,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:44:05,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:05,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:05,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:05,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:05,048 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:05,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:05,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:44:05,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:44:05,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:05,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:44:05,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:44:05,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:44:05,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:44:05,051 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:44:05,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:44:05,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:05,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:05,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:44:05,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:05,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:05,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:44:05,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:44:05,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:05,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:05,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:44:05,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:44:05,054 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:44:05,054 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:44:05,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:44:05,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:44:05,055 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_9ea1ac20-63cc-4a81-b8fd-b01e18303419/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 -> 3b7d4038cc97a5525f6c2d1d321f9913af8a8ee1 [2019-11-16 00:44:05,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:05,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:05,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:05,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:05,101 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:05,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:44:05,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/81f8bd23e/a2dc41a97d4b487787096e14fc8a3b39/FLAG85761b2b6 [2019-11-16 00:44:05,706 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:05,707 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:44:05,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/81f8bd23e/a2dc41a97d4b487787096e14fc8a3b39/FLAG85761b2b6 [2019-11-16 00:44:05,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/data/81f8bd23e/a2dc41a97d4b487787096e14fc8a3b39 [2019-11-16 00:44:05,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:05,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:05,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:05,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:05,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:05,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:05" (1/1) ... [2019-11-16 00:44:05,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc5ce5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:05, skipping insertion in model container [2019-11-16 00:44:05,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:05" (1/1) ... [2019-11-16 00:44:05,901 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:05,974 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:06,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:06,554 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:06,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:06,769 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:06,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06 WrapperNode [2019-11-16 00:44:06,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:06,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:06,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:06,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:06,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:06,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:06,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:06,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:06,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:07,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:07,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:07,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:07,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:07,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:07,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:07,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:44:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:44:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:44:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:44:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:44:07,359 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:44:09,787 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:44:09,787 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:44:09,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:09,789 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:44:09,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:09 BoogieIcfgContainer [2019-11-16 00:44:09,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:09,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:44:09,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:44:09,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:44:09,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:44:05" (1/3) ... [2019-11-16 00:44:09,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a84999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:09, skipping insertion in model container [2019-11-16 00:44:09,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (2/3) ... [2019-11-16 00:44:09,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a84999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:09, skipping insertion in model container [2019-11-16 00:44:09,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:09" (3/3) ... [2019-11-16 00:44:09,800 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2019-11-16 00:44:09,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:44:09,820 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:44:09,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:44:09,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:44:09,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:44:09,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:44:09,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:09,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:09,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:44:09,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:09,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:44:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:44:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:44:09,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:09,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:09,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-16 00:44:09,937 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:09,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1871291240] [2019-11-16 00:44:09,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:10,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:10,259 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:10,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1871291240] [2019-11-16 00:44:10,291 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:10,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:44:10,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679135882] [2019-11-16 00:44:10,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:10,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:10,314 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-16 00:44:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:10,554 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-16 00:44:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:10,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:44:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:10,588 INFO L225 Difference]: With dead ends: 564 [2019-11-16 00:44:10,589 INFO L226 Difference]: Without dead ends: 385 [2019-11-16 00:44:10,594 INFO L600 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-11-16 00:44:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-16 00:44:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-16 00:44:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-16 00:44:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-16 00:44:10,703 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-16 00:44:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:10,704 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-16 00:44:10,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-16 00:44:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:44:10,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:10,715 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:10,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:10,918 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290477, now seen corresponding path program 1 times [2019-11-16 00:44:10,920 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:10,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1677582004] [2019-11-16 00:44:10,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:11,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:11,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:11,162 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:11,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1677582004] [2019-11-16 00:44:11,185 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:11,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:44:11,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443404494] [2019-11-16 00:44:11,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:11,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:11,188 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-16 00:44:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:12,484 INFO L93 Difference]: Finished difference Result 880 states and 1354 transitions. [2019-11-16 00:44:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:12,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-16 00:44:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:12,490 INFO L225 Difference]: With dead ends: 880 [2019-11-16 00:44:12,490 INFO L226 Difference]: Without dead ends: 629 [2019-11-16 00:44:12,493 INFO L600 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-11-16 00:44:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-16 00:44:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-11-16 00:44:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-16 00:44:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-11-16 00:44:12,523 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 58 [2019-11-16 00:44:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:12,524 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-11-16 00:44:12,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-11-16 00:44:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:44:12,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:12,529 INFO L380 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] [2019-11-16 00:44:12,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:12,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 647290871, now seen corresponding path program 1 times [2019-11-16 00:44:12,736 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:12,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [336245305] [2019-11-16 00:44:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:13,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:13,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:13,047 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:13,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336245305] [2019-11-16 00:44:13,145 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:13,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:44:13,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624816121] [2019-11-16 00:44:13,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:13,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:13,151 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 4 states. [2019-11-16 00:44:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:13,575 INFO L93 Difference]: Finished difference Result 1368 states and 2093 transitions. [2019-11-16 00:44:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:13,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-16 00:44:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:13,583 INFO L225 Difference]: With dead ends: 1368 [2019-11-16 00:44:13,584 INFO L226 Difference]: Without dead ends: 873 [2019-11-16 00:44:13,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 216 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-11-16 00:44:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-11-16 00:44:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2019-11-16 00:44:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-11-16 00:44:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1324 transitions. [2019-11-16 00:44:13,628 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1324 transitions. Word has length 110 [2019-11-16 00:44:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:13,629 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1324 transitions. [2019-11-16 00:44:13,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1324 transitions. [2019-11-16 00:44:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-16 00:44:13,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:13,635 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:13,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:13,842 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1563243915, now seen corresponding path program 1 times [2019-11-16 00:44:13,843 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:13,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [949000823] [2019-11-16 00:44:13,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:14,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:44:14,189 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:44:14,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949000823] [2019-11-16 00:44:14,232 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:14,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:44:14,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459620976] [2019-11-16 00:44:14,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:14,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:14,235 INFO L87 Difference]: Start difference. First operand 873 states and 1324 transitions. Second operand 4 states. [2019-11-16 00:44:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:15,615 INFO L93 Difference]: Finished difference Result 1861 states and 2834 transitions. [2019-11-16 00:44:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:15,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-16 00:44:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:15,624 INFO L225 Difference]: With dead ends: 1861 [2019-11-16 00:44:15,624 INFO L226 Difference]: Without dead ends: 1120 [2019-11-16 00:44:15,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 274 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-11-16 00:44:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-11-16 00:44:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2019-11-16 00:44:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-11-16 00:44:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1694 transitions. [2019-11-16 00:44:15,680 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1694 transitions. Word has length 139 [2019-11-16 00:44:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:15,681 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 1694 transitions. [2019-11-16 00:44:15,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1694 transitions. [2019-11-16 00:44:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:44:15,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:15,690 INFO L380 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] [2019-11-16 00:44:15,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:15,894 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 959908544, now seen corresponding path program 1 times [2019-11-16 00:44:15,894 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:15,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [850250258] [2019-11-16 00:44:15,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:18,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:18,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:18,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:44:18,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:18,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:44:18,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:18,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:44:18,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:18,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:18,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:18,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:44:18,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:18,773 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:18,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:18,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:44:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:18,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850250258] [2019-11-16 00:44:18,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:18,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:44:18,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434706448] [2019-11-16 00:44:18,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:18,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:18,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:18,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:18,823 INFO L87 Difference]: Start difference. First operand 1120 states and 1694 transitions. Second operand 4 states. [2019-11-16 00:44:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:24,811 INFO L93 Difference]: Finished difference Result 3276 states and 4978 transitions. [2019-11-16 00:44:24,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:24,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:44:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:24,827 INFO L225 Difference]: With dead ends: 3276 [2019-11-16 00:44:24,827 INFO L226 Difference]: Without dead ends: 2164 [2019-11-16 00:44:24,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-16 00:44:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1372. [2019-11-16 00:44:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-16 00:44:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2144 transitions. [2019-11-16 00:44:24,896 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2144 transitions. Word has length 163 [2019-11-16 00:44:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:24,897 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 2144 transitions. [2019-11-16 00:44:24,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2144 transitions. [2019-11-16 00:44:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:44:24,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:24,903 INFO L380 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, 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] [2019-11-16 00:44:25,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:25,114 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2081031755, now seen corresponding path program 1 times [2019-11-16 00:44:25,115 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:25,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1479515678] [2019-11-16 00:44:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:27,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:27,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:27,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:27,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:44:27,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:44:27,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:44:27,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 91 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:27,860 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:27,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:44:27,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,903 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:27,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:27,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:44:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:27,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1479515678] [2019-11-16 00:44:27,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:27,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:44:27,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226349521] [2019-11-16 00:44:27,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:27,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:27,931 INFO L87 Difference]: Start difference. First operand 1372 states and 2144 transitions. Second operand 4 states. [2019-11-16 00:44:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:31,241 INFO L93 Difference]: Finished difference Result 3780 states and 5878 transitions. [2019-11-16 00:44:31,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:31,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-16 00:44:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:31,257 INFO L225 Difference]: With dead ends: 3780 [2019-11-16 00:44:31,257 INFO L226 Difference]: Without dead ends: 2416 [2019-11-16 00:44:31,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-11-16 00:44:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1633. [2019-11-16 00:44:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-11-16 00:44:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2612 transitions. [2019-11-16 00:44:31,334 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2612 transitions. Word has length 164 [2019-11-16 00:44:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:31,334 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 2612 transitions. [2019-11-16 00:44:31,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2612 transitions. [2019-11-16 00:44:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-16 00:44:31,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:31,339 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-16 00:44:31,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:31,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -846659623, now seen corresponding path program 1 times [2019-11-16 00:44:31,555 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:31,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1839895787] [2019-11-16 00:44:31,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:34,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:34,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:34,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:34,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:44:34,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:34,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:44:34,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:34,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:44:34,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:34,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:34,806 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:34,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:44:34,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:34,837 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:34,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:34,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:44:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:34,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1839895787] [2019-11-16 00:44:34,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:34,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:44:34,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847229789] [2019-11-16 00:44:34,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:34,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:34,907 INFO L87 Difference]: Start difference. First operand 1633 states and 2612 transitions. Second operand 4 states. [2019-11-16 00:44:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:39,464 INFO L93 Difference]: Finished difference Result 4302 states and 6796 transitions. [2019-11-16 00:44:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:39,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-16 00:44:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:39,482 INFO L225 Difference]: With dead ends: 4302 [2019-11-16 00:44:39,482 INFO L226 Difference]: Without dead ends: 2677 [2019-11-16 00:44:39,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2019-11-16 00:44:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 1867. [2019-11-16 00:44:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-11-16 00:44:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 3017 transitions. [2019-11-16 00:44:39,564 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 3017 transitions. Word has length 191 [2019-11-16 00:44:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:39,564 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 3017 transitions. [2019-11-16 00:44:39,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 3017 transitions. [2019-11-16 00:44:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:44:39,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:39,570 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-16 00:44:39,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:39,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash -69051324, now seen corresponding path program 1 times [2019-11-16 00:44:39,782 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:39,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [258704841] [2019-11-16 00:44:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:42,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:42,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:42,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:42,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:44:42,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:42,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:44:42,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:42,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:44:42,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:42,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 207 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:42,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:42,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:44:42,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:42,968 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:42,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:42,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:44:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:44:43,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258704841] [2019-11-16 00:44:43,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:43,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:44:43,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464972597] [2019-11-16 00:44:43,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:43,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:43,008 INFO L87 Difference]: Start difference. First operand 1867 states and 3017 transitions. Second operand 4 states. [2019-11-16 00:44:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:48,207 INFO L93 Difference]: Finished difference Result 4509 states and 7147 transitions. [2019-11-16 00:44:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:48,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-16 00:44:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:48,224 INFO L225 Difference]: With dead ends: 4509 [2019-11-16 00:44:48,224 INFO L226 Difference]: Without dead ends: 2650 [2019-11-16 00:44:48,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:44:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-11-16 00:44:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 1867. [2019-11-16 00:44:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-11-16 00:44:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2999 transitions. [2019-11-16 00:44:48,302 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2999 transitions. Word has length 192 [2019-11-16 00:44:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:48,302 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 2999 transitions. [2019-11-16 00:44:48,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2999 transitions. [2019-11-16 00:44:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:44:48,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:48,308 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:48,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:48,522 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash -791919411, now seen corresponding path program 1 times [2019-11-16 00:44:48,522 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:44:48,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [805502908] [2019-11-16 00:44:48,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:53,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:53,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:53,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:53,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:44:53,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:53,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:44:53,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:53,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:44:53,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:53,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:44:53,963 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:44:53,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:44:53,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:53,986 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:53,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:53,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:44:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:44:54,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [805502908] [2019-11-16 00:44:54,013 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:54,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:44:54,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804633454] [2019-11-16 00:44:54,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:44:54,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:44:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:44:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:54,014 INFO L87 Difference]: Start difference. First operand 1867 states and 2999 transitions. Second operand 7 states. [2019-11-16 00:45:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:10,080 INFO L93 Difference]: Finished difference Result 5348 states and 8348 transitions. [2019-11-16 00:45:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:45:10,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-11-16 00:45:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:10,096 INFO L225 Difference]: With dead ends: 5348 [2019-11-16 00:45:10,096 INFO L226 Difference]: Without dead ends: 3489 [2019-11-16 00:45:10,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:45:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-11-16 00:45:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 2200. [2019-11-16 00:45:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-11-16 00:45:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3575 transitions. [2019-11-16 00:45:10,195 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3575 transitions. Word has length 192 [2019-11-16 00:45:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:10,195 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 3575 transitions. [2019-11-16 00:45:10,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:45:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3575 transitions. [2019-11-16 00:45:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:45:10,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:10,201 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:10,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:10,415 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:45:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1406420013, now seen corresponding path program 1 times [2019-11-16 00:45:10,416 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:45:10,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1445349797] [2019-11-16 00:45:10,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:15,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:45:15,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:15,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:15,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:45:15,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:45:15,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:45:15,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:45:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:45:16,004 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:45:16,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:45:16,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:16,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:16,028 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:16,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:16,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:16,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:45:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:45:16,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445349797] [2019-11-16 00:45:16,088 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:45:16,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:45:16,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740539473] [2019-11-16 00:45:16,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:45:16,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:45:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:45:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:45:16,089 INFO L87 Difference]: Start difference. First operand 2200 states and 3575 transitions. Second operand 7 states. [2019-11-16 00:45:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:30,641 INFO L93 Difference]: Finished difference Result 5720 states and 9015 transitions. [2019-11-16 00:45:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:45:30,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-11-16 00:45:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:30,659 INFO L225 Difference]: With dead ends: 5720 [2019-11-16 00:45:30,659 INFO L226 Difference]: Without dead ends: 3528 [2019-11-16 00:45:30,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:45:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-11-16 00:45:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2281. [2019-11-16 00:45:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-16 00:45:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3728 transitions. [2019-11-16 00:45:30,759 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3728 transitions. Word has length 193 [2019-11-16 00:45:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:30,760 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3728 transitions. [2019-11-16 00:45:30,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:45:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3728 transitions. [2019-11-16 00:45:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:45:30,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:30,766 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:30,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:30,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:45:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1735547418, now seen corresponding path program 2 times [2019-11-16 00:45:30,990 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:45:30,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [670212772] [2019-11-16 00:45:30,990 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:31,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:45:31,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:45:31,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:45:31,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:31,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:45:31,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-16 00:45:31,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:31,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:45:31,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-16 00:45:31,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:45:31,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:45:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-16 00:45:31,984 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:45:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-16 00:45:32,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [670212772] [2019-11-16 00:45:32,048 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:45:32,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-16 00:45:32,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146044043] [2019-11-16 00:45:32,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:45:32,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:45:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:45:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:45:32,049 INFO L87 Difference]: Start difference. First operand 2281 states and 3728 transitions. Second operand 8 states. [2019-11-16 00:45:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:45,074 INFO L93 Difference]: Finished difference Result 6389 states and 10134 transitions. [2019-11-16 00:45:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:45:45,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-11-16 00:45:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:45,094 INFO L225 Difference]: With dead ends: 6389 [2019-11-16 00:45:45,095 INFO L226 Difference]: Without dead ends: 4116 [2019-11-16 00:45:45,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 434 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:45:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2019-11-16 00:45:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 2481. [2019-11-16 00:45:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-16 00:45:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4044 transitions. [2019-11-16 00:45:45,209 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4044 transitions. Word has length 221 [2019-11-16 00:45:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:45,209 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 4044 transitions. [2019-11-16 00:45:45,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:45:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4044 transitions. [2019-11-16 00:45:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:45:45,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:45,216 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:45,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:45,424 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:45:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1263207772, now seen corresponding path program 1 times [2019-11-16 00:45:45,425 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:45:45,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [942892501] [2019-11-16 00:45:45,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:45:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:51,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:45:51,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:51,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:51,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:45:51,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:51,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:51,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:51,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:45:51,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:51,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:45:51,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:51,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:51,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:51,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:45:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-16 00:45:52,034 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:45:52,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:45:52,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:52,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:52,073 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:52,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:52,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:52,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:45:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-16 00:45:52,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942892501] [2019-11-16 00:45:52,119 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:45:52,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:45:52,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741353871] [2019-11-16 00:45:52,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:45:52,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:45:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:45:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:45:52,120 INFO L87 Difference]: Start difference. First operand 2481 states and 4044 transitions. Second operand 7 states. [2019-11-16 00:46:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:46:09,160 INFO L93 Difference]: Finished difference Result 6489 states and 10286 transitions. [2019-11-16 00:46:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:46:09,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2019-11-16 00:46:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:46:09,172 INFO L225 Difference]: With dead ends: 6489 [2019-11-16 00:46:09,173 INFO L226 Difference]: Without dead ends: 4016 [2019-11-16 00:46:09,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:46:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2019-11-16 00:46:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2769. [2019-11-16 00:46:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2019-11-16 00:46:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 4512 transitions. [2019-11-16 00:46:09,283 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 4512 transitions. Word has length 221 [2019-11-16 00:46:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:46:09,284 INFO L462 AbstractCegarLoop]: Abstraction has 2769 states and 4512 transitions. [2019-11-16 00:46:09,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:46:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 4512 transitions. [2019-11-16 00:46:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-16 00:46:09,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:46:09,293 INFO L380 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, 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-11-16 00:46:09,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:46:09,506 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:46:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:46:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1214559478, now seen corresponding path program 1 times [2019-11-16 00:46:09,507 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:46:09,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [178596324] [2019-11-16 00:46:09,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea1ac20-63cc-4a81-b8fd-b01e18303419/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:46:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:46:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-16 00:46:12,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:46:13,652 INFO L235 Elim1Store]: Index analysis took 174 ms [2019-11-16 00:46:13,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:13,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:46:13,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:15,954 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-16 00:46:15,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:15,957 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_206|, |v_#memory_$Pointer$.base_206|], 2=[|v_#memory_$Pointer$.offset_203|, |v_#memory_$Pointer$.base_203|, |v_#memory_$Pointer$.base_202|, |v_#memory_$Pointer$.offset_202|]} [2019-11-16 00:46:16,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:16,517 INFO L235 Elim1Store]: Index analysis took 423 ms [2019-11-16 00:46:16,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 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-11-16 00:46:16,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:18,934 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:46:18,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:19,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:19,382 INFO L235 Elim1Store]: Index analysis took 379 ms [2019-11-16 00:46:19,880 INFO L375 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-11-16 00:46:19,880 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:20,767 WARN L191 SmtUtils]: Spent 886.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:46:20,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:20,785 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:21,356 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-16 00:46:21,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:21,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,519 INFO L375 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-11-16 00:46:21,519 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:21,836 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:46:21,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:21,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:21,899 INFO L375 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-11-16 00:46:21,900 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,083 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:46:22,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,106 INFO L375 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 52 treesize of output 46 [2019-11-16 00:46:22,107 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,158 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-16 00:46:22,190 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_207|], 12=[|v_#memory_$Pointer$.base_207|]} [2019-11-16 00:46:22,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:46:22,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,262 INFO L375 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 72 treesize of output 44 [2019-11-16 00:46:22,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,290 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:46:22,299 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_208|], 12=[|v_#memory_$Pointer$.base_208|]} [2019-11-16 00:46:22,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:46:22,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,393 INFO L375 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 72 treesize of output 44 [2019-11-16 00:46:22,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:46:22,419 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_204|, |v_#memory_$Pointer$.offset_209|, |v_#memory_$Pointer$.base_204|], 12=[|v_#memory_$Pointer$.base_209|]} [2019-11-16 00:46:22,428 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:22,643 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:46:22,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,674 INFO L375 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 34 treesize of output 22 [2019-11-16 00:46:22,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,809 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-16 00:46:22,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,812 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:22,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,913 INFO L375 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 77 treesize of output 53 [2019-11-16 00:46:22,913 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,945 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-16 00:46:22,955 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_210|], 12=[|v_#memory_$Pointer$.base_210|]} [2019-11-16 00:46:22,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:22,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:46:22,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:23,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,022 INFO L375 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 72 treesize of output 44 [2019-11-16 00:46:23,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:23,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:46:23,053 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_211|], 12=[|v_#memory_$Pointer$.base_211|]} [2019-11-16 00:46:23,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:46:23,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:23,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,121 INFO L375 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 72 treesize of output 44 [2019-11-16 00:46:23,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:23,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:46:23,149 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_212|], 20=[|v_#memory_$Pointer$.base_212|]} [2019-11-16 00:46:23,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 95 [2019-11-16 00:46:23,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:23,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:23,471 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-16 00:46:23,471 INFO L341 Elim1Store]: treesize reduction 40, result has 81.2 percent of original size [2019-11-16 00:46:23,471 INFO L375 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 229 [2019-11-16 00:46:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:46:23,508 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:23,610 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-11-16 00:46:23,610 INFO L567 ElimStorePlain]: treesize reduction 162, result has 40.9 percent of original size [2019-11-16 00:46:23,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:23,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:127 [2019-11-16 00:46:23,670 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.base_205|], 20=[|v_#memory_$Pointer$.offset_213|], 30=[|v_#memory_$Pointer$.base_213|]} [2019-11-16 00:46:23,683 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:24,033 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:46:24,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:24,043 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:24,224 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:46:24,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:24,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2019-11-16 00:46:24,278 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:24,480 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-16 00:46:24,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:24,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:24,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:30,866 WARN L191 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:46:30,866 INFO L341 Elim1Store]: treesize reduction 57, result has 75.0 percent of original size [2019-11-16 00:46:30,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 258 [2019-11-16 00:46:30,868 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:30,991 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-11-16 00:46:30,991 INFO L567 ElimStorePlain]: treesize reduction 225, result has 39.2 percent of original size [2019-11-16 00:46:30,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:30,992 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:203, output treesize:127 [2019-11-16 00:46:31,010 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_214|], 30=[|v_#memory_$Pointer$.base_214|]} [2019-11-16 00:46:31,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2019-11-16 00:46:31,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:31,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:31,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,370 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-16 00:46:31,371 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-16 00:46:31,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 198 [2019-11-16 00:46:31,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:31,465 INFO L567 ElimStorePlain]: treesize reduction 156, result has 44.9 percent of original size [2019-11-16 00:46:31,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:31,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:127 [2019-11-16 00:46:31,468 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_231|], 20=[|v_#memory_$Pointer$.offset_215|], 30=[|v_#memory_$Pointer$.base_215|]} [2019-11-16 00:46:31,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-16 00:46:31,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:31,600 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:46:31,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:31,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:31,629 INFO L375 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 197 [2019-11-16 00:46:31,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:31,781 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-16 00:46:31,782 INFO L567 ElimStorePlain]: treesize reduction 56, result has 77.9 percent of original size [2019-11-16 00:46:31,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:31,992 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-16 00:46:31,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:31,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 185 treesize of output 298 [2019-11-16 00:46:31,994 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:32,112 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-11-16 00:46:32,112 INFO L567 ElimStorePlain]: treesize reduction 244, result has 37.8 percent of original size [2019-11-16 00:46:32,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:32,112 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:256, output treesize:148 [2019-11-16 00:46:32,177 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_232|], 20=[|v_#memory_$Pointer$.offset_216|], 30=[|v_#memory_$Pointer$.base_216|]} [2019-11-16 00:46:32,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-16 00:46:32,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:32,316 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:46:32,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:32,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 96 [2019-11-16 00:46:32,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:32,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:32,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:32,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:34,670 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-16 00:46:34,670 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-16 00:46:34,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 155 treesize of output 213 [2019-11-16 00:46:34,672 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:34,849 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-11-16 00:46:34,849 INFO L567 ElimStorePlain]: treesize reduction 156, result has 50.2 percent of original size [2019-11-16 00:46:34,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:34,850 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:199, output treesize:157 [2019-11-16 00:46:34,942 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_233|], 12=[|v_#memory_$Pointer$.offset_217|], 20=[|v_#memory_$Pointer$.base_217|]} [2019-11-16 00:46:34,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:34,958 INFO L375 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 62 treesize of output 46 [2019-11-16 00:46:34,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:35,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:35,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 58 [2019-11-16 00:46:35,015 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:35,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:35,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:46:35,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:35,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 93 [2019-11-16 00:46:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:35,133 INFO L496 ElimStorePlain]: Start of recursive call 4: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2019-11-16 00:46:35,439 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-11-16 00:46:35,440 INFO L567 ElimStorePlain]: treesize reduction 100, result has 60.5 percent of original size [2019-11-16 00:46:35,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:35,442 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:188, output treesize:113 [2019-11-16 00:46:35,542 INFO L375 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 33 treesize of output 13 [2019-11-16 00:46:35,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:35,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:35,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:46:35,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-11-16 00:46:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 301 proven. 119 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:46:36,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:46:36,108 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,129 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,135 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:44 [2019-11-16 00:46:36,190 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_221|, |v_#memory_$Pointer$.base_221|], 2=[|#memory_int|]} [2019-11-16 00:46:36,193 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,239 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 195 [2019-11-16 00:46:36,275 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:36,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,361 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:191 [2019-11-16 00:46:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,447 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,460 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,474 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,488 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,759 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-11-16 00:46:36,759 INFO L567 ElimStorePlain]: treesize reduction 381, result has 38.4 percent of original size [2019-11-16 00:46:36,767 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,773 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:36,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:36,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-11-16 00:46:36,843 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:529, output treesize:257 [2019-11-16 00:46:36,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:37,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:38,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:39,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:40,871 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.base_205|], 6=[|v_#memory_$Pointer$.base_223|, |v_#memory_$Pointer$.offset_223|]} [2019-11-16 00:46:40,892 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:40,914 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:40,941 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:40,953 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:43,145 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-11-16 00:46:43,145 INFO L567 ElimStorePlain]: treesize reduction 42, result has 93.3 percent of original size [2019-11-16 00:46:43,165 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:43,188 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:43,210 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:43,229 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:44,766 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-16 00:46:44,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:44,777 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:44,794 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:44,812 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:44,827 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:45,298 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-16 00:46:45,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:45,309 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:45,323 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:45,343 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:45,358 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:45,613 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-11-16 00:46:45,613 INFO L567 ElimStorePlain]: treesize reduction 444, result has 43.5 percent of original size [2019-11-16 00:46:45,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-16 00:46:45,614 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:689, output treesize:342 [2019-11-16 00:46:45,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:45,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:46,174 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_225|], 41=[|v_#memory_$Pointer$.base_225|]} [2019-11-16 00:46:46,178 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:46,330 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-16 00:46:46,331 INFO L567 ElimStorePlain]: treesize reduction 352, result has 55.3 percent of original size [2019-11-16 00:46:46,332 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:46,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:46,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:46:46,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:637, output treesize:654 [2019-11-16 00:46:48,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:46:48,752 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:46:48,756 INFO L168 Benchmark]: Toolchain (without parser) took 162868.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:48,756 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:46:48,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 881.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:48,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.31 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-11-16 00:46:48,757 INFO L168 Benchmark]: Boogie Preprocessor took 131.59 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-11-16 00:46:48,757 INFO L168 Benchmark]: RCFGBuilder took 2769.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:48,758 INFO L168 Benchmark]: TraceAbstraction took 158962.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -70.8 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:48,760 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 881.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.31 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 131.59 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 2769.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158962.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -70.8 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...