./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-678e011 [2019-11-19 23:36:07,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:36:07,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:36:07,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:36:07,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:36:07,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:36:07,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:36:07,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:36:07,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:36:07,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:36:07,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:36:07,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:36:07,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:36:07,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:36:07,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:36:07,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:36:07,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:36:07,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:36:07,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:36:07,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:36:07,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:36:07,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:36:07,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:36:07,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:36:07,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:36:07,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:36:07,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:36:07,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:36:07,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:36:07,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:36:07,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:36:07,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:36:07,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:36:07,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:36:07,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:36:07,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:36:07,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:36:07,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:36:07,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:36:07,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:36:07,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:36:07,237 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:36:07,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:36:07,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:36:07,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:36:07,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:36:07,262 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:36:07,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:36:07,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:36:07,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:36:07,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:36:07,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:36:07,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:36:07,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:36:07,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:36:07,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:36:07,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:36:07,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:36:07,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:36:07,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:36:07,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:36:07,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:36:07,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:36:07,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:36:07,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:36:07,266 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_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:36:07,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:36:07,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:36:07,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:36:07,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:36:07,426 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:36:07,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:36:07,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/2186aff4c/092976483105442391bed7fcbf72dd3d/FLAG36bdcc909 [2019-11-19 23:36:08,036 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:36:08,037 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:36:08,060 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/2186aff4c/092976483105442391bed7fcbf72dd3d/FLAG36bdcc909 [2019-11-19 23:36:08,496 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/2186aff4c/092976483105442391bed7fcbf72dd3d [2019-11-19 23:36:08,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:36:08,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:36:08,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:36:08,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:36:08,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:36:08,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:36:08" (1/1) ... [2019-11-19 23:36:08,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed0a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:08, skipping insertion in model container [2019-11-19 23:36:08,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:36:08" (1/1) ... [2019-11-19 23:36:08,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:36:08,590 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:36:08,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:36:09,013 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:36:09,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:36:09,176 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:36:09,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09 WrapperNode [2019-11-19 23:36:09,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:36:09,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:36:09,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:36:09,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:36:09,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:36:09,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:36:09,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:36:09,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:36:09,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... [2019-11-19 23:36:09,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:36:09,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:36:09,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:36:09,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:36:09,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:36:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:36:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:36:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:36:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:36:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:36:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:36:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:36:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:36:09,710 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:10,596 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:36:10,597 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:36:10,598 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:36:10,598 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:36:10,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:36:10 BoogieIcfgContainer [2019-11-19 23:36:10,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:36:10,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:36:10,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:36:10,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:36:10,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:36:08" (1/3) ... [2019-11-19 23:36:10,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0df7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:36:10, skipping insertion in model container [2019-11-19 23:36:10,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:09" (2/3) ... [2019-11-19 23:36:10,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0df7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:36:10, skipping insertion in model container [2019-11-19 23:36:10,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:36:10" (3/3) ... [2019-11-19 23:36:10,605 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:36:10,614 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:36:10,620 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:36:10,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:36:10,651 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:36:10,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:36:10,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:36:10,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:36:10,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:36:10,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:36:10,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:36:10,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:36:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-19 23:36:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:36:10,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:10,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:10,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-19 23:36:10,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:10,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898271281] [2019-11-19 23:36:10,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:11,036 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-19 23:36:11,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898271281] [2019-11-19 23:36:11,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:11,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:11,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144974746] [2019-11-19 23:36:11,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:11,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:11,058 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-19 23:36:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:11,693 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-19 23:36:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:11,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 23:36:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:11,712 INFO L225 Difference]: With dead ends: 323 [2019-11-19 23:36:11,712 INFO L226 Difference]: Without dead ends: 163 [2019-11-19 23:36:11,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-19 23:36:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-19 23:36:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-19 23:36:11,778 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-19 23:36:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:11,779 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-19 23:36:11,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-19 23:36:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 23:36:11,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:11,781 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:11,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-19 23:36:11,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:11,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958485497] [2019-11-19 23:36:11,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:11,955 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-19 23:36:11,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958485497] [2019-11-19 23:36:11,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:11,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:11,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917473639] [2019-11-19 23:36:11,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:11,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:11,959 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-19 23:36:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:12,307 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-19 23:36:12,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:12,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-19 23:36:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:12,309 INFO L225 Difference]: With dead ends: 290 [2019-11-19 23:36:12,309 INFO L226 Difference]: Without dead ends: 163 [2019-11-19 23:36:12,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-19 23:36:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-19 23:36:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-19 23:36:12,332 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-19 23:36:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:12,332 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-19 23:36:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-19 23:36:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 23:36:12,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:12,335 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:12,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-19 23:36:12,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:12,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983281669] [2019-11-19 23:36:12,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:12,412 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-19 23:36:12,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983281669] [2019-11-19 23:36:12,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:12,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:12,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409094168] [2019-11-19 23:36:12,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:12,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:12,414 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-19 23:36:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:12,752 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-19 23:36:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:12,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-19 23:36:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:12,756 INFO L225 Difference]: With dead ends: 289 [2019-11-19 23:36:12,756 INFO L226 Difference]: Without dead ends: 162 [2019-11-19 23:36:12,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-19 23:36:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-19 23:36:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-19 23:36:12,773 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-19 23:36:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:12,773 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-19 23:36:12,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-19 23:36:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 23:36:12,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:12,776 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:12,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-19 23:36:12,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:12,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812989865] [2019-11-19 23:36:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:12,876 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-19 23:36:12,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812989865] [2019-11-19 23:36:12,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:12,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:12,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25002078] [2019-11-19 23:36:12,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:12,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:12,879 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-19 23:36:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:13,240 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-19 23:36:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:13,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-19 23:36:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:13,242 INFO L225 Difference]: With dead ends: 287 [2019-11-19 23:36:13,242 INFO L226 Difference]: Without dead ends: 160 [2019-11-19 23:36:13,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-19 23:36:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-19 23:36:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-19 23:36:13,251 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-19 23:36:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:13,251 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-19 23:36:13,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-19 23:36:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 23:36:13,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:13,253 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:13,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-19 23:36:13,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:13,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745118036] [2019-11-19 23:36:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:13,356 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-19 23:36:13,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745118036] [2019-11-19 23:36:13,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:13,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140133801] [2019-11-19 23:36:13,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:13,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:13,360 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-19 23:36:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:13,681 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-19 23:36:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:13,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-19 23:36:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:13,683 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:36:13,683 INFO L226 Difference]: Without dead ends: 159 [2019-11-19 23:36:13,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-19 23:36:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-19 23:36:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-19 23:36:13,696 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-19 23:36:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:13,697 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-19 23:36:13,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-19 23:36:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 23:36:13,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:13,700 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:13,700 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-19 23:36:13,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:13,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913811251] [2019-11-19 23:36:13,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:13,790 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-19 23:36:13,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913811251] [2019-11-19 23:36:13,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:13,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:13,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025302087] [2019-11-19 23:36:13,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:13,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:13,792 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-19 23:36:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:14,078 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-19 23:36:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:14,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-19 23:36:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:14,080 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:36:14,080 INFO L226 Difference]: Without dead ends: 159 [2019-11-19 23:36:14,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-19 23:36:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-19 23:36:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-19 23:36:14,097 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-19 23:36:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:14,101 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-19 23:36:14,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-19 23:36:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 23:36:14,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:14,102 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:14,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-19 23:36:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932988056] [2019-11-19 23:36:14,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:14,162 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-19 23:36:14,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932988056] [2019-11-19 23:36:14,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:14,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:14,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529504827] [2019-11-19 23:36:14,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:14,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:14,169 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-19 23:36:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:14,451 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-19 23:36:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:14,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-19 23:36:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:14,452 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:36:14,453 INFO L226 Difference]: Without dead ends: 159 [2019-11-19 23:36:14,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-19 23:36:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-19 23:36:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-19 23:36:14,461 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-19 23:36:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:14,461 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-19 23:36:14,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-19 23:36:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 23:36:14,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:14,463 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:14,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-19 23:36:14,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:14,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722635411] [2019-11-19 23:36:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:14,548 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-19 23:36:14,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722635411] [2019-11-19 23:36:14,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:14,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:14,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605776700] [2019-11-19 23:36:14,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:14,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:14,552 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-19 23:36:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:14,832 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-19 23:36:14,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:14,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-19 23:36:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:14,834 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:36:14,834 INFO L226 Difference]: Without dead ends: 159 [2019-11-19 23:36:14,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-19 23:36:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-19 23:36:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-19 23:36:14,839 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-19 23:36:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:14,839 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-19 23:36:14,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-19 23:36:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 23:36:14,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:14,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:14,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-19 23:36:14,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:14,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968392994] [2019-11-19 23:36:14,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:14,893 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-19 23:36:14,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968392994] [2019-11-19 23:36:14,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:14,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:14,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089993489] [2019-11-19 23:36:14,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:14,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:14,896 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-19 23:36:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:15,145 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-19 23:36:15,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:15,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-19 23:36:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:15,146 INFO L225 Difference]: With dead ends: 276 [2019-11-19 23:36:15,146 INFO L226 Difference]: Without dead ends: 149 [2019-11-19 23:36:15,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-19 23:36:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-19 23:36:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 23:36:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-19 23:36:15,151 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-19 23:36:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:15,151 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-19 23:36:15,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-19 23:36:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 23:36:15,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:15,152 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:15,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-19 23:36:15,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:15,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021894361] [2019-11-19 23:36:15,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:15,206 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-19 23:36:15,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021894361] [2019-11-19 23:36:15,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:15,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:15,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216496945] [2019-11-19 23:36:15,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:15,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:15,208 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-19 23:36:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:15,522 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-19 23:36:15,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:15,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-19 23:36:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:15,524 INFO L225 Difference]: With dead ends: 316 [2019-11-19 23:36:15,524 INFO L226 Difference]: Without dead ends: 189 [2019-11-19 23:36:15,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-19 23:36:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-19 23:36:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-19 23:36:15,530 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-19 23:36:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:15,531 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-19 23:36:15,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-19 23:36:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 23:36:15,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:15,532 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:15,532 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-19 23:36:15,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:15,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380076787] [2019-11-19 23:36:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:15,584 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-19 23:36:15,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380076787] [2019-11-19 23:36:15,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:15,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:15,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799037298] [2019-11-19 23:36:15,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:15,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:15,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:15,585 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-19 23:36:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:15,902 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-19 23:36:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:15,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-19 23:36:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:15,904 INFO L225 Difference]: With dead ends: 338 [2019-11-19 23:36:15,904 INFO L226 Difference]: Without dead ends: 189 [2019-11-19 23:36:15,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-19 23:36:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-19 23:36:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-19 23:36:15,911 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-19 23:36:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:15,911 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-19 23:36:15,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-19 23:36:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 23:36:15,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:15,913 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:15,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:15,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-19 23:36:15,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:15,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708325484] [2019-11-19 23:36:15,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:15,975 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-19 23:36:15,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708325484] [2019-11-19 23:36:15,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:15,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:15,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727761700] [2019-11-19 23:36:15,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:15,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:15,983 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-19 23:36:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:16,324 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-19 23:36:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:16,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-19 23:36:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:16,326 INFO L225 Difference]: With dead ends: 337 [2019-11-19 23:36:16,326 INFO L226 Difference]: Without dead ends: 188 [2019-11-19 23:36:16,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-19 23:36:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-19 23:36:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-19 23:36:16,333 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-19 23:36:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:16,333 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-19 23:36:16,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-19 23:36:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 23:36:16,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:16,337 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:16,337 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:16,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-19 23:36:16,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:16,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804358653] [2019-11-19 23:36:16,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:16,391 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-19 23:36:16,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804358653] [2019-11-19 23:36:16,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:16,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:16,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132987992] [2019-11-19 23:36:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:16,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:16,417 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-19 23:36:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:16,741 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-19 23:36:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:16,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-19 23:36:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:16,743 INFO L225 Difference]: With dead ends: 335 [2019-11-19 23:36:16,743 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 23:36:16,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 23:36:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-19 23:36:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-19 23:36:16,748 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-19 23:36:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:16,749 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-19 23:36:16,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-19 23:36:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 23:36:16,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:16,751 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:16,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-19 23:36:16,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:16,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137212887] [2019-11-19 23:36:16,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:16,804 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-19 23:36:16,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137212887] [2019-11-19 23:36:16,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:16,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:16,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749332167] [2019-11-19 23:36:16,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:16,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:16,806 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-19 23:36:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:17,137 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-19 23:36:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:17,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-19 23:36:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:17,139 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:36:17,139 INFO L226 Difference]: Without dead ends: 185 [2019-11-19 23:36:17,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-19 23:36:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-19 23:36:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-19 23:36:17,144 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-19 23:36:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:17,144 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-19 23:36:17,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-19 23:36:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 23:36:17,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:17,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:17,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-19 23:36:17,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:17,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369688750] [2019-11-19 23:36:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:17,206 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-19 23:36:17,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369688750] [2019-11-19 23:36:17,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:17,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:17,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514005867] [2019-11-19 23:36:17,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:17,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:17,208 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-19 23:36:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:17,530 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-19 23:36:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:17,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-19 23:36:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:17,532 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:36:17,532 INFO L226 Difference]: Without dead ends: 185 [2019-11-19 23:36:17,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-19 23:36:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-19 23:36:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-19 23:36:17,537 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-19 23:36:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:17,537 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-19 23:36:17,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-19 23:36:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 23:36:17,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:17,538 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:17,538 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-19 23:36:17,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:17,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688318383] [2019-11-19 23:36:17,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:17,590 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-19 23:36:17,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688318383] [2019-11-19 23:36:17,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:17,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:17,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887498267] [2019-11-19 23:36:17,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:17,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:17,594 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-19 23:36:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:17,919 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-19 23:36:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:17,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-19 23:36:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:17,921 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:36:17,921 INFO L226 Difference]: Without dead ends: 185 [2019-11-19 23:36:17,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-19 23:36:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-19 23:36:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-19 23:36:17,929 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-19 23:36:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:17,929 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-19 23:36:17,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-19 23:36:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-19 23:36:17,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:17,931 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:17,931 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-19 23:36:17,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:17,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8501326] [2019-11-19 23:36:17,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:17,973 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-19 23:36:17,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8501326] [2019-11-19 23:36:17,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:17,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:17,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778676172] [2019-11-19 23:36:17,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:17,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:17,975 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-19 23:36:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:18,326 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-19 23:36:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:18,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-19 23:36:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:18,328 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:36:18,328 INFO L226 Difference]: Without dead ends: 185 [2019-11-19 23:36:18,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-19 23:36:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-19 23:36:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-19 23:36:18,334 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-19 23:36:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:18,334 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-19 23:36:18,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-19 23:36:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 23:36:18,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:18,336 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:18,336 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-19 23:36:18,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:18,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047855761] [2019-11-19 23:36:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:18,383 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-19 23:36:18,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047855761] [2019-11-19 23:36:18,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:18,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:18,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882168097] [2019-11-19 23:36:18,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:18,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:18,385 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-19 23:36:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:18,723 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-19 23:36:18,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:18,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-19 23:36:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:18,725 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:36:18,725 INFO L226 Difference]: Without dead ends: 175 [2019-11-19 23:36:18,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-19 23:36:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-19 23:36:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:36:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-19 23:36:18,730 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-19 23:36:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:18,730 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-19 23:36:18,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-19 23:36:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 23:36:18,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:18,731 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:18,731 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-19 23:36:18,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:18,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010391796] [2019-11-19 23:36:18,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:18,843 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-19 23:36:18,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010391796] [2019-11-19 23:36:18,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:18,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:18,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292189400] [2019-11-19 23:36:18,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:18,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:18,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:18,845 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-19 23:36:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:19,335 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-19 23:36:19,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:19,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-19 23:36:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:19,337 INFO L225 Difference]: With dead ends: 424 [2019-11-19 23:36:19,338 INFO L226 Difference]: Without dead ends: 275 [2019-11-19 23:36:19,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-19 23:36:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-19 23:36:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-19 23:36:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-19 23:36:19,342 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-19 23:36:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:19,343 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-19 23:36:19,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-19 23:36:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 23:36:19,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:19,344 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:19,344 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-19 23:36:19,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:19,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615831660] [2019-11-19 23:36:19,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:19,401 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-19 23:36:19,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615831660] [2019-11-19 23:36:19,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:19,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:19,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485275581] [2019-11-19 23:36:19,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:19,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:19,404 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-19 23:36:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:19,782 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-19 23:36:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:19,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-19 23:36:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:19,784 INFO L225 Difference]: With dead ends: 427 [2019-11-19 23:36:19,784 INFO L226 Difference]: Without dead ends: 248 [2019-11-19 23:36:19,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-19 23:36:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-19 23:36:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-19 23:36:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-19 23:36:19,792 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-19 23:36:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:19,792 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-19 23:36:19,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-19 23:36:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:36:19,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:19,794 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:19,794 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-19 23:36:19,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:19,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113595291] [2019-11-19 23:36:19,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:19,876 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-19 23:36:19,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113595291] [2019-11-19 23:36:19,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:19,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:19,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858468968] [2019-11-19 23:36:19,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:19,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:19,879 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-19 23:36:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:20,293 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-19 23:36:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:20,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 23:36:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:20,295 INFO L225 Difference]: With dead ends: 494 [2019-11-19 23:36:20,295 INFO L226 Difference]: Without dead ends: 291 [2019-11-19 23:36:20,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-19 23:36:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-19 23:36:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-19 23:36:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-19 23:36:20,301 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-19 23:36:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:20,301 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-19 23:36:20,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-19 23:36:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-19 23:36:20,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:20,303 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:20,303 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2019-11-19 23:36:20,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:20,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066881875] [2019-11-19 23:36:20,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:20,371 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-19 23:36:20,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066881875] [2019-11-19 23:36:20,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:20,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:20,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926448997] [2019-11-19 23:36:20,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:20,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:20,373 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-19 23:36:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:20,837 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-19 23:36:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:20,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-19 23:36:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:20,841 INFO L225 Difference]: With dead ends: 495 [2019-11-19 23:36:20,841 INFO L226 Difference]: Without dead ends: 291 [2019-11-19 23:36:20,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-19 23:36:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-19 23:36:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-19 23:36:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-19 23:36:20,847 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-19 23:36:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:20,848 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-19 23:36:20,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-19 23:36:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 23:36:20,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:20,849 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:20,849 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2019-11-19 23:36:20,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:20,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723157964] [2019-11-19 23:36:20,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:20,920 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-19 23:36:20,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723157964] [2019-11-19 23:36:20,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:20,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:20,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888370788] [2019-11-19 23:36:20,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:20,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:20,924 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-19 23:36:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:21,345 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-19 23:36:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:21,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-19 23:36:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:21,347 INFO L225 Difference]: With dead ends: 499 [2019-11-19 23:36:21,347 INFO L226 Difference]: Without dead ends: 285 [2019-11-19 23:36:21,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-19 23:36:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-19 23:36:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-19 23:36:21,353 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-19 23:36:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:21,354 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-19 23:36:21,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-19 23:36:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 23:36:21,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:21,355 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:21,355 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-19 23:36:21,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:21,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244031583] [2019-11-19 23:36:21,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:21,409 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-19 23:36:21,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244031583] [2019-11-19 23:36:21,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:21,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:21,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886571327] [2019-11-19 23:36:21,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:21,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:21,411 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-19 23:36:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:21,926 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-19 23:36:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:21,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-19 23:36:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:21,927 INFO L225 Difference]: With dead ends: 500 [2019-11-19 23:36:21,927 INFO L226 Difference]: Without dead ends: 285 [2019-11-19 23:36:21,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-19 23:36:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-19 23:36:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-19 23:36:21,932 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-19 23:36:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:21,933 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-19 23:36:21,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-19 23:36:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 23:36:21,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:21,934 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:21,934 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-19 23:36:21,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:21,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707935717] [2019-11-19 23:36:21,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:21,992 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-19 23:36:21,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707935717] [2019-11-19 23:36:21,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:21,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:21,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099003443] [2019-11-19 23:36:21,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:21,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:21,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:21,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:21,995 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-19 23:36:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:22,355 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-19 23:36:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:22,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-19 23:36:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:22,358 INFO L225 Difference]: With dead ends: 475 [2019-11-19 23:36:22,358 INFO L226 Difference]: Without dead ends: 260 [2019-11-19 23:36:22,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-19 23:36:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-19 23:36:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-19 23:36:22,364 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-19 23:36:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:22,364 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-19 23:36:22,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-19 23:36:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:22,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:22,365 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:22,365 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-19 23:36:22,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:22,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918687210] [2019-11-19 23:36:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:22,421 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-19 23:36:22,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918687210] [2019-11-19 23:36:22,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:22,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:22,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976699097] [2019-11-19 23:36:22,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:22,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:22,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:22,423 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-19 23:36:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:22,925 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-19 23:36:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:22,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-19 23:36:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:22,927 INFO L225 Difference]: With dead ends: 499 [2019-11-19 23:36:22,927 INFO L226 Difference]: Without dead ends: 284 [2019-11-19 23:36:22,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-19 23:36:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-19 23:36:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-19 23:36:22,935 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-19 23:36:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:22,935 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-19 23:36:22,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-19 23:36:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:22,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:22,937 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:22,937 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-19 23:36:22,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:22,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644675086] [2019-11-19 23:36:22,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:22,988 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-19 23:36:22,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644675086] [2019-11-19 23:36:22,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:22,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703785739] [2019-11-19 23:36:22,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:22,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:22,990 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-19 23:36:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:23,577 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-19 23:36:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:23,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-19 23:36:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:23,580 INFO L225 Difference]: With dead ends: 497 [2019-11-19 23:36:23,580 INFO L226 Difference]: Without dead ends: 282 [2019-11-19 23:36:23,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-19 23:36:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-19 23:36:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-19 23:36:23,587 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-19 23:36:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:23,587 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-19 23:36:23,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-19 23:36:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:23,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:23,589 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:23,589 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-19 23:36:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:23,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81691672] [2019-11-19 23:36:23,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:23,660 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-19 23:36:23,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81691672] [2019-11-19 23:36:23,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:23,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:23,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267147977] [2019-11-19 23:36:23,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:23,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:23,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:23,663 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-19 23:36:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:24,210 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-19 23:36:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:24,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-19 23:36:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:24,213 INFO L225 Difference]: With dead ends: 496 [2019-11-19 23:36:24,213 INFO L226 Difference]: Without dead ends: 281 [2019-11-19 23:36:24,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-19 23:36:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-19 23:36:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-19 23:36:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-19 23:36:24,219 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-19 23:36:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:24,219 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-19 23:36:24,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-19 23:36:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:24,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:24,220 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:24,221 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-19 23:36:24,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:24,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910421885] [2019-11-19 23:36:24,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:24,306 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-19 23:36:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910421885] [2019-11-19 23:36:24,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:24,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:24,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425961598] [2019-11-19 23:36:24,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:24,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:24,309 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-19 23:36:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:24,890 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-19 23:36:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:36:24,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-19 23:36:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:24,892 INFO L225 Difference]: With dead ends: 470 [2019-11-19 23:36:24,893 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 23:36:24,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 23:36:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-19 23:36:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-19 23:36:24,901 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-19 23:36:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:24,901 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-19 23:36:24,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-19 23:36:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:24,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:24,903 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:24,903 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-19 23:36:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:24,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631759115] [2019-11-19 23:36:24,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:36:24,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631759115] [2019-11-19 23:36:24,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:24,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:24,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311656051] [2019-11-19 23:36:24,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:24,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:24,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:24,969 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-19 23:36:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:25,397 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-19 23:36:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-19 23:36:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:25,400 INFO L225 Difference]: With dead ends: 512 [2019-11-19 23:36:25,400 INFO L226 Difference]: Without dead ends: 277 [2019-11-19 23:36:25,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-19 23:36:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-19 23:36:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-19 23:36:25,410 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-19 23:36:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:25,411 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-19 23:36:25,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-19 23:36:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:36:25,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:25,412 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:25,413 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-19 23:36:25,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021512522] [2019-11-19 23:36:25,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:25,477 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-19 23:36:25,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021512522] [2019-11-19 23:36:25,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:25,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:25,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639735041] [2019-11-19 23:36:25,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:25,479 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-19 23:36:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:25,917 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-19 23:36:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:25,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-19 23:36:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:25,919 INFO L225 Difference]: With dead ends: 511 [2019-11-19 23:36:25,919 INFO L226 Difference]: Without dead ends: 276 [2019-11-19 23:36:25,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-19 23:36:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-19 23:36:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-19 23:36:25,932 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-19 23:36:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:25,932 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-19 23:36:25,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-19 23:36:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-19 23:36:25,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:25,934 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:25,935 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-19 23:36:25,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:25,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211672926] [2019-11-19 23:36:25,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:25,992 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-19 23:36:25,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211672926] [2019-11-19 23:36:25,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:25,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:25,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279184862] [2019-11-19 23:36:25,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:25,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:25,995 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-19 23:36:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:26,552 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-19 23:36:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:26,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-19 23:36:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:26,554 INFO L225 Difference]: With dead ends: 536 [2019-11-19 23:36:26,554 INFO L226 Difference]: Without dead ends: 301 [2019-11-19 23:36:26,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-19 23:36:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-19 23:36:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-19 23:36:26,561 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-19 23:36:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:26,562 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-19 23:36:26,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-19 23:36:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-19 23:36:26,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:26,564 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:26,564 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:26,564 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-19 23:36:26,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:26,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732803379] [2019-11-19 23:36:26,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:26,628 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-19 23:36:26,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732803379] [2019-11-19 23:36:26,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:26,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:26,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293505962] [2019-11-19 23:36:26,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:26,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:26,631 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-19 23:36:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:26,993 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-19 23:36:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:26,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-19 23:36:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:26,996 INFO L225 Difference]: With dead ends: 511 [2019-11-19 23:36:26,996 INFO L226 Difference]: Without dead ends: 276 [2019-11-19 23:36:26,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-19 23:36:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-19 23:36:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-19 23:36:27,005 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-19 23:36:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:27,006 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-19 23:36:27,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-19 23:36:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 23:36:27,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:27,008 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:27,008 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-19 23:36:27,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:27,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468868353] [2019-11-19 23:36:27,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:27,069 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-19 23:36:27,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468868353] [2019-11-19 23:36:27,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:27,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:27,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441819060] [2019-11-19 23:36:27,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:27,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:27,072 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-19 23:36:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:27,582 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-19 23:36:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:27,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-19 23:36:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:27,584 INFO L225 Difference]: With dead ends: 536 [2019-11-19 23:36:27,584 INFO L226 Difference]: Without dead ends: 301 [2019-11-19 23:36:27,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-19 23:36:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-19 23:36:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-19 23:36:27,593 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-19 23:36:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:27,593 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-19 23:36:27,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-19 23:36:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 23:36:27,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:27,595 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:27,595 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-19 23:36:27,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:27,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297042603] [2019-11-19 23:36:27,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:27,664 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-19 23:36:27,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297042603] [2019-11-19 23:36:27,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:27,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:27,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414375270] [2019-11-19 23:36:27,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:27,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:27,666 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-19 23:36:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:28,146 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-19 23:36:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:28,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-19 23:36:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:28,148 INFO L225 Difference]: With dead ends: 511 [2019-11-19 23:36:28,148 INFO L226 Difference]: Without dead ends: 276 [2019-11-19 23:36:28,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-19 23:36:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-19 23:36:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-19 23:36:28,157 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-19 23:36:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:28,157 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-19 23:36:28,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-19 23:36:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 23:36:28,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:28,159 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:28,159 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-19 23:36:28,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:28,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40916540] [2019-11-19 23:36:28,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:28,232 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-19 23:36:28,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40916540] [2019-11-19 23:36:28,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:28,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567304411] [2019-11-19 23:36:28,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:28,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:28,235 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-19 23:36:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:28,633 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-19 23:36:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:28,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-19 23:36:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:28,635 INFO L225 Difference]: With dead ends: 536 [2019-11-19 23:36:28,635 INFO L226 Difference]: Without dead ends: 301 [2019-11-19 23:36:28,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-19 23:36:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-19 23:36:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-19 23:36:28,643 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-19 23:36:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:28,643 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-19 23:36:28,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-19 23:36:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 23:36:28,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:28,645 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:28,645 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-19 23:36:28,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:28,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514298130] [2019-11-19 23:36:28,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:28,712 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-19 23:36:28,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514298130] [2019-11-19 23:36:28,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:28,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:28,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167327176] [2019-11-19 23:36:28,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:28,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:28,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:28,714 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-19 23:36:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:29,079 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-19 23:36:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:29,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-19 23:36:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:29,082 INFO L225 Difference]: With dead ends: 511 [2019-11-19 23:36:29,082 INFO L226 Difference]: Without dead ends: 276 [2019-11-19 23:36:29,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-19 23:36:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-19 23:36:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-19 23:36:29,088 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-19 23:36:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:29,089 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-19 23:36:29,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-19 23:36:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-19 23:36:29,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:29,090 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:29,091 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-19 23:36:29,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:29,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376050968] [2019-11-19 23:36:29,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:29,138 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-19 23:36:29,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376050968] [2019-11-19 23:36:29,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:29,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:29,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659529830] [2019-11-19 23:36:29,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:29,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:29,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:29,141 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-19 23:36:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:29,475 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-19 23:36:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:29,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-19 23:36:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:29,477 INFO L225 Difference]: With dead ends: 526 [2019-11-19 23:36:29,477 INFO L226 Difference]: Without dead ends: 291 [2019-11-19 23:36:29,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-19 23:36:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-19 23:36:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-19 23:36:29,486 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-19 23:36:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:29,486 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-19 23:36:29,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-19 23:36:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-19 23:36:29,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:29,487 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:29,488 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-19 23:36:29,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:29,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756328291] [2019-11-19 23:36:29,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:29,549 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-19 23:36:29,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756328291] [2019-11-19 23:36:29,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:29,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:29,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689675763] [2019-11-19 23:36:29,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:29,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:29,551 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-19 23:36:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:29,882 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-19 23:36:29,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:29,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-19 23:36:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:29,884 INFO L225 Difference]: With dead ends: 501 [2019-11-19 23:36:29,885 INFO L226 Difference]: Without dead ends: 266 [2019-11-19 23:36:29,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-19 23:36:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-19 23:36:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-19 23:36:29,892 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-19 23:36:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:29,892 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-19 23:36:29,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-19 23:36:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 23:36:29,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:29,893 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:29,894 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-19 23:36:29,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:29,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062137825] [2019-11-19 23:36:29,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:29,944 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-19 23:36:29,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062137825] [2019-11-19 23:36:29,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:29,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:29,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656228167] [2019-11-19 23:36:29,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:29,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:29,947 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-19 23:36:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:30,336 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-19 23:36:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:30,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-19 23:36:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:30,338 INFO L225 Difference]: With dead ends: 526 [2019-11-19 23:36:30,338 INFO L226 Difference]: Without dead ends: 291 [2019-11-19 23:36:30,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-19 23:36:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-19 23:36:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-19 23:36:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-19 23:36:30,346 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-19 23:36:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:30,346 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-19 23:36:30,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-19 23:36:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 23:36:30,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:30,348 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:30,348 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-19 23:36:30,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:30,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062412705] [2019-11-19 23:36:30,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:30,409 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-19 23:36:30,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062412705] [2019-11-19 23:36:30,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:30,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:30,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195137978] [2019-11-19 23:36:30,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:30,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:30,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,412 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-19 23:36:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:30,466 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-19 23:36:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:30,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-19 23:36:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:30,469 INFO L225 Difference]: With dead ends: 722 [2019-11-19 23:36:30,469 INFO L226 Difference]: Without dead ends: 487 [2019-11-19 23:36:30,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-19 23:36:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-19 23:36:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-19 23:36:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-19 23:36:30,485 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-19 23:36:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:30,486 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-19 23:36:30,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-19 23:36:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:36:30,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:30,488 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:30,488 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-19 23:36:30,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:30,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063107195] [2019-11-19 23:36:30,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:30,554 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-19 23:36:30,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063107195] [2019-11-19 23:36:30,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:30,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:30,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128528544] [2019-11-19 23:36:30,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:30,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,556 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-19 23:36:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:30,618 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-19 23:36:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:30,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-19 23:36:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:30,622 INFO L225 Difference]: With dead ends: 1190 [2019-11-19 23:36:30,622 INFO L226 Difference]: Without dead ends: 722 [2019-11-19 23:36:30,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-19 23:36:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-19 23:36:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-19 23:36:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-19 23:36:30,641 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-19 23:36:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:30,641 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-19 23:36:30,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-19 23:36:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-19 23:36:30,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:30,643 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:30,643 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2019-11-19 23:36:30,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:30,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367849405] [2019-11-19 23:36:30,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:30,695 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-19 23:36:30,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367849405] [2019-11-19 23:36:30,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:30,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:30,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726444102] [2019-11-19 23:36:30,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:30,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:30,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:30,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,699 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-19 23:36:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:30,787 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-19 23:36:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:30,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-19 23:36:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:30,792 INFO L225 Difference]: With dead ends: 1656 [2019-11-19 23:36:30,792 INFO L226 Difference]: Without dead ends: 955 [2019-11-19 23:36:30,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-19 23:36:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-19 23:36:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-19 23:36:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-19 23:36:30,820 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-19 23:36:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:30,821 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-19 23:36:30,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-19 23:36:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 23:36:30,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:30,824 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:30,824 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2019-11-19 23:36:30,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:30,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891978592] [2019-11-19 23:36:30,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:30,892 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-19 23:36:30,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891978592] [2019-11-19 23:36:30,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:30,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:30,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990676176] [2019-11-19 23:36:30,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:30,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,895 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-19 23:36:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:30,948 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-19 23:36:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:30,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 23:36:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:30,954 INFO L225 Difference]: With dead ends: 2120 [2019-11-19 23:36:30,954 INFO L226 Difference]: Without dead ends: 1186 [2019-11-19 23:36:30,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-19 23:36:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-19 23:36:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-19 23:36:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-19 23:36:30,985 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-19 23:36:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:30,986 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-19 23:36:30,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-19 23:36:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-19 23:36:30,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:30,988 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:30,989 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-19 23:36:30,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:30,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974312557] [2019-11-19 23:36:30,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:31,042 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-19 23:36:31,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974312557] [2019-11-19 23:36:31,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:31,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:31,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745969181] [2019-11-19 23:36:31,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:31,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:31,044 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-19 23:36:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:31,110 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-19 23:36:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:31,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-19 23:36:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:31,117 INFO L225 Difference]: With dead ends: 1423 [2019-11-19 23:36:31,117 INFO L226 Difference]: Without dead ends: 1421 [2019-11-19 23:36:31,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-19 23:36:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-19 23:36:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-19 23:36:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-19 23:36:31,153 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-19 23:36:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:31,154 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-19 23:36:31,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-19 23:36:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-19 23:36:31,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:31,157 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:31,157 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-11-19 23:36:31,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:31,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985708730] [2019-11-19 23:36:31,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:31,228 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-19 23:36:31,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985708730] [2019-11-19 23:36:31,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:31,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:31,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577257583] [2019-11-19 23:36:31,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:31,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:31,230 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 4 states. [2019-11-19 23:36:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:31,740 INFO L93 Difference]: Finished difference Result 3197 states and 4729 transitions. [2019-11-19 23:36:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:31,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-19 23:36:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:31,749 INFO L225 Difference]: With dead ends: 3197 [2019-11-19 23:36:31,749 INFO L226 Difference]: Without dead ends: 1797 [2019-11-19 23:36:31,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-11-19 23:36:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1587. [2019-11-19 23:36:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-11-19 23:36:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2380 transitions. [2019-11-19 23:36:31,797 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2380 transitions. Word has length 163 [2019-11-19 23:36:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:31,797 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2380 transitions. [2019-11-19 23:36:31,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2380 transitions. [2019-11-19 23:36:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-19 23:36:31,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:31,800 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:31,801 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:31,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-19 23:36:31,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:31,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734471120] [2019-11-19 23:36:31,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:31,891 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-19 23:36:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734471120] [2019-11-19 23:36:31,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:31,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:31,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053445532] [2019-11-19 23:36:31,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:31,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:31,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:31,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:31,893 INFO L87 Difference]: Start difference. First operand 1587 states and 2380 transitions. Second operand 3 states. [2019-11-19 23:36:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:31,966 INFO L93 Difference]: Finished difference Result 2372 states and 3561 transitions. [2019-11-19 23:36:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:31,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-19 23:36:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:31,976 INFO L225 Difference]: With dead ends: 2372 [2019-11-19 23:36:31,976 INFO L226 Difference]: Without dead ends: 1848 [2019-11-19 23:36:31,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-11-19 23:36:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1848. [2019-11-19 23:36:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2775 transitions. [2019-11-19 23:36:32,019 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2775 transitions. Word has length 164 [2019-11-19 23:36:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:32,019 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2775 transitions. [2019-11-19 23:36:32,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2775 transitions. [2019-11-19 23:36:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-19 23:36:32,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:32,023 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:32,023 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2020286926, now seen corresponding path program 1 times [2019-11-19 23:36:32,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:32,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899752006] [2019-11-19 23:36:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:32,099 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-19 23:36:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899752006] [2019-11-19 23:36:32,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:32,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:32,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957578457] [2019-11-19 23:36:32,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:32,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:32,101 INFO L87 Difference]: Start difference. First operand 1848 states and 2775 transitions. Second operand 4 states. [2019-11-19 23:36:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:32,490 INFO L93 Difference]: Finished difference Result 3922 states and 5855 transitions. [2019-11-19 23:36:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:32,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-19 23:36:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:32,501 INFO L225 Difference]: With dead ends: 3922 [2019-11-19 23:36:32,501 INFO L226 Difference]: Without dead ends: 2093 [2019-11-19 23:36:32,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-19 23:36:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-19 23:36:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2768 transitions. [2019-11-19 23:36:32,548 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2768 transitions. Word has length 176 [2019-11-19 23:36:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:32,548 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2768 transitions. [2019-11-19 23:36:32,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2768 transitions. [2019-11-19 23:36:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-19 23:36:32,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:32,551 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:32,552 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 163592357, now seen corresponding path program 1 times [2019-11-19 23:36:32,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:32,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353616983] [2019-11-19 23:36:32,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:32,627 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-19 23:36:32,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353616983] [2019-11-19 23:36:32,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:32,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:32,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754038388] [2019-11-19 23:36:32,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:32,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:32,629 INFO L87 Difference]: Start difference. First operand 1848 states and 2768 transitions. Second operand 4 states. [2019-11-19 23:36:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:32,989 INFO L93 Difference]: Finished difference Result 3908 states and 5827 transitions. [2019-11-19 23:36:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:32,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-19 23:36:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:33,000 INFO L225 Difference]: With dead ends: 3908 [2019-11-19 23:36:33,000 INFO L226 Difference]: Without dead ends: 2079 [2019-11-19 23:36:33,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-19 23:36:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1848. [2019-11-19 23:36:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2761 transitions. [2019-11-19 23:36:33,047 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2761 transitions. Word has length 177 [2019-11-19 23:36:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2761 transitions. [2019-11-19 23:36:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2761 transitions. [2019-11-19 23:36:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-19 23:36:33,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:33,050 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:33,050 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-11-19 23:36:33,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:33,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726285528] [2019-11-19 23:36:33,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:33,128 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-19 23:36:33,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726285528] [2019-11-19 23:36:33,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:33,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:33,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726909841] [2019-11-19 23:36:33,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:33,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:33,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:33,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:33,130 INFO L87 Difference]: Start difference. First operand 1848 states and 2761 transitions. Second operand 4 states. [2019-11-19 23:36:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:33,522 INFO L93 Difference]: Finished difference Result 3901 states and 5806 transitions. [2019-11-19 23:36:33,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:33,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-19 23:36:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:33,533 INFO L225 Difference]: With dead ends: 3901 [2019-11-19 23:36:33,533 INFO L226 Difference]: Without dead ends: 2072 [2019-11-19 23:36:33,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-19 23:36:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-19 23:36:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2754 transitions. [2019-11-19 23:36:33,577 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2754 transitions. Word has length 177 [2019-11-19 23:36:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:33,578 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2754 transitions. [2019-11-19 23:36:33,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2754 transitions. [2019-11-19 23:36:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-19 23:36:33,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:33,581 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:33,582 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2019-11-19 23:36:33,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:33,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814185166] [2019-11-19 23:36:33,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:33,661 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-19 23:36:33,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814185166] [2019-11-19 23:36:33,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:33,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:33,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438984492] [2019-11-19 23:36:33,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:33,665 INFO L87 Difference]: Start difference. First operand 1848 states and 2754 transitions. Second operand 4 states. [2019-11-19 23:36:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:34,054 INFO L93 Difference]: Finished difference Result 3901 states and 5792 transitions. [2019-11-19 23:36:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:34,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-19 23:36:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:34,065 INFO L225 Difference]: With dead ends: 3901 [2019-11-19 23:36:34,066 INFO L226 Difference]: Without dead ends: 2072 [2019-11-19 23:36:34,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-19 23:36:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-19 23:36:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2747 transitions. [2019-11-19 23:36:34,119 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2747 transitions. Word has length 178 [2019-11-19 23:36:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:34,120 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2747 transitions. [2019-11-19 23:36:34,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2747 transitions. [2019-11-19 23:36:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-19 23:36:34,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:34,124 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:34,124 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2019-11-19 23:36:34,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:34,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282170825] [2019-11-19 23:36:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:34,253 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-19 23:36:34,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282170825] [2019-11-19 23:36:34,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:34,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:34,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079943124] [2019-11-19 23:36:34,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:34,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:34,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:34,256 INFO L87 Difference]: Start difference. First operand 1848 states and 2747 transitions. Second operand 4 states. [2019-11-19 23:36:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:34,697 INFO L93 Difference]: Finished difference Result 3901 states and 5778 transitions. [2019-11-19 23:36:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:34,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-19 23:36:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:34,716 INFO L225 Difference]: With dead ends: 3901 [2019-11-19 23:36:34,723 INFO L226 Difference]: Without dead ends: 2072 [2019-11-19 23:36:34,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-19 23:36:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-19 23:36:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2740 transitions. [2019-11-19 23:36:34,767 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2740 transitions. Word has length 179 [2019-11-19 23:36:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:34,767 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2740 transitions. [2019-11-19 23:36:34,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2740 transitions. [2019-11-19 23:36:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-19 23:36:34,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:34,770 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:34,771 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2019-11-19 23:36:34,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:34,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970764194] [2019-11-19 23:36:34,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:34,857 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-19 23:36:34,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970764194] [2019-11-19 23:36:34,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:34,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:34,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573971309] [2019-11-19 23:36:34,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:34,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:34,859 INFO L87 Difference]: Start difference. First operand 1848 states and 2740 transitions. Second operand 4 states. [2019-11-19 23:36:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:35,336 INFO L93 Difference]: Finished difference Result 3901 states and 5764 transitions. [2019-11-19 23:36:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:35,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-19 23:36:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:35,342 INFO L225 Difference]: With dead ends: 3901 [2019-11-19 23:36:35,342 INFO L226 Difference]: Without dead ends: 2072 [2019-11-19 23:36:35,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-19 23:36:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-19 23:36:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2733 transitions. [2019-11-19 23:36:35,383 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2733 transitions. Word has length 180 [2019-11-19 23:36:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:35,383 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2733 transitions. [2019-11-19 23:36:35,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2733 transitions. [2019-11-19 23:36:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-19 23:36:35,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:35,387 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:35,387 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2019-11-19 23:36:35,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:35,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688903793] [2019-11-19 23:36:35,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:35,464 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-19 23:36:35,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688903793] [2019-11-19 23:36:35,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:35,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:35,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971382800] [2019-11-19 23:36:35,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:35,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:35,466 INFO L87 Difference]: Start difference. First operand 1848 states and 2733 transitions. Second operand 4 states. [2019-11-19 23:36:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:35,859 INFO L93 Difference]: Finished difference Result 3831 states and 5666 transitions. [2019-11-19 23:36:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:35,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-19 23:36:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:35,863 INFO L225 Difference]: With dead ends: 3831 [2019-11-19 23:36:35,863 INFO L226 Difference]: Without dead ends: 2002 [2019-11-19 23:36:35,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-19 23:36:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-19 23:36:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2726 transitions. [2019-11-19 23:36:35,900 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2726 transitions. Word has length 181 [2019-11-19 23:36:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:35,900 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2726 transitions. [2019-11-19 23:36:35,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2726 transitions. [2019-11-19 23:36:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-19 23:36:35,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:35,903 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:35,903 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2019-11-19 23:36:35,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:35,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941340114] [2019-11-19 23:36:35,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:35,986 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-19 23:36:35,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941340114] [2019-11-19 23:36:35,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:35,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:35,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145282192] [2019-11-19 23:36:35,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:35,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:35,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:35,988 INFO L87 Difference]: Start difference. First operand 1848 states and 2726 transitions. Second operand 4 states. [2019-11-19 23:36:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:36,281 INFO L93 Difference]: Finished difference Result 3831 states and 5652 transitions. [2019-11-19 23:36:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:36,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-19 23:36:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:36,288 INFO L225 Difference]: With dead ends: 3831 [2019-11-19 23:36:36,288 INFO L226 Difference]: Without dead ends: 2002 [2019-11-19 23:36:36,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-19 23:36:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-19 23:36:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2719 transitions. [2019-11-19 23:36:36,328 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2719 transitions. Word has length 185 [2019-11-19 23:36:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:36,329 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2719 transitions. [2019-11-19 23:36:36,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2719 transitions. [2019-11-19 23:36:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-19 23:36:36,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:36,332 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:36,332 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2019-11-19 23:36:36,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:36,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327637154] [2019-11-19 23:36:36,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:36,416 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-19 23:36:36,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327637154] [2019-11-19 23:36:36,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:36,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:36,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977607449] [2019-11-19 23:36:36,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:36,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:36,418 INFO L87 Difference]: Start difference. First operand 1848 states and 2719 transitions. Second operand 4 states. [2019-11-19 23:36:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:36,708 INFO L93 Difference]: Finished difference Result 3831 states and 5638 transitions. [2019-11-19 23:36:36,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:36,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-19 23:36:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:36,713 INFO L225 Difference]: With dead ends: 3831 [2019-11-19 23:36:36,713 INFO L226 Difference]: Without dead ends: 2002 [2019-11-19 23:36:36,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-19 23:36:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-19 23:36:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2712 transitions. [2019-11-19 23:36:36,754 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2712 transitions. Word has length 185 [2019-11-19 23:36:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:36,754 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2712 transitions. [2019-11-19 23:36:36,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2712 transitions. [2019-11-19 23:36:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:36:36,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:36,757 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:36,758 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2019-11-19 23:36:36,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:36,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280668032] [2019-11-19 23:36:36,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:36,887 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-19 23:36:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280668032] [2019-11-19 23:36:36,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228889062] [2019-11-19 23:36:36,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:36,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:36,891 INFO L87 Difference]: Start difference. First operand 1848 states and 2712 transitions. Second operand 4 states. [2019-11-19 23:36:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:37,204 INFO L93 Difference]: Finished difference Result 3803 states and 5585 transitions. [2019-11-19 23:36:37,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:37,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-19 23:36:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:37,209 INFO L225 Difference]: With dead ends: 3803 [2019-11-19 23:36:37,209 INFO L226 Difference]: Without dead ends: 1974 [2019-11-19 23:36:37,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-19 23:36:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1848. [2019-11-19 23:36:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2705 transitions. [2019-11-19 23:36:37,250 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2705 transitions. Word has length 186 [2019-11-19 23:36:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:37,250 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2705 transitions. [2019-11-19 23:36:37,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2705 transitions. [2019-11-19 23:36:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:36:37,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:37,254 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:37,254 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2019-11-19 23:36:37,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:37,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942805092] [2019-11-19 23:36:37,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:37,338 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-19 23:36:37,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942805092] [2019-11-19 23:36:37,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:37,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:37,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820414994] [2019-11-19 23:36:37,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:37,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:37,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:37,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:37,340 INFO L87 Difference]: Start difference. First operand 1848 states and 2705 transitions. Second operand 4 states. [2019-11-19 23:36:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:37,810 INFO L93 Difference]: Finished difference Result 3768 states and 5525 transitions. [2019-11-19 23:36:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:37,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-19 23:36:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:37,814 INFO L225 Difference]: With dead ends: 3768 [2019-11-19 23:36:37,815 INFO L226 Difference]: Without dead ends: 1939 [2019-11-19 23:36:37,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-19 23:36:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1848. [2019-11-19 23:36:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-19 23:36:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2698 transitions. [2019-11-19 23:36:37,855 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2698 transitions. Word has length 186 [2019-11-19 23:36:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:37,855 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2698 transitions. [2019-11-19 23:36:37,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2698 transitions. [2019-11-19 23:36:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-19 23:36:37,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:37,858 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:37,858 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2019-11-19 23:36:37,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:37,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439797123] [2019-11-19 23:36:37,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:37,945 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-19 23:36:37,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439797123] [2019-11-19 23:36:37,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:37,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:37,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013849617] [2019-11-19 23:36:37,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:37,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:37,947 INFO L87 Difference]: Start difference. First operand 1848 states and 2698 transitions. Second operand 4 states. [2019-11-19 23:36:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:38,327 INFO L93 Difference]: Finished difference Result 4146 states and 6093 transitions. [2019-11-19 23:36:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:38,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-19 23:36:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:38,331 INFO L225 Difference]: With dead ends: 4146 [2019-11-19 23:36:38,331 INFO L226 Difference]: Without dead ends: 2317 [2019-11-19 23:36:38,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-19 23:36:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2058. [2019-11-19 23:36:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-11-19 23:36:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3069 transitions. [2019-11-19 23:36:38,376 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3069 transitions. Word has length 188 [2019-11-19 23:36:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:38,377 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3069 transitions. [2019-11-19 23:36:38,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3069 transitions. [2019-11-19 23:36:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-19 23:36:38,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:38,380 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:38,380 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1629892887, now seen corresponding path program 1 times [2019-11-19 23:36:38,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:38,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787066583] [2019-11-19 23:36:38,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:38,491 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-19 23:36:38,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787066583] [2019-11-19 23:36:38,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:38,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:38,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190143066] [2019-11-19 23:36:38,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:38,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:38,493 INFO L87 Difference]: Start difference. First operand 2058 states and 3069 transitions. Second operand 4 states. [2019-11-19 23:36:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:39,046 INFO L93 Difference]: Finished difference Result 4813 states and 7201 transitions. [2019-11-19 23:36:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:39,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-19 23:36:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:39,050 INFO L225 Difference]: With dead ends: 4813 [2019-11-19 23:36:39,050 INFO L226 Difference]: Without dead ends: 2774 [2019-11-19 23:36:39,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-11-19 23:36:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2254. [2019-11-19 23:36:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-19 23:36:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3412 transitions. [2019-11-19 23:36:39,102 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3412 transitions. Word has length 194 [2019-11-19 23:36:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:39,103 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 3412 transitions. [2019-11-19 23:36:39,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3412 transitions. [2019-11-19 23:36:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-19 23:36:39,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:39,108 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:39,108 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash -893401278, now seen corresponding path program 1 times [2019-11-19 23:36:39,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:39,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639504803] [2019-11-19 23:36:39,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:39,205 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-19 23:36:39,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639504803] [2019-11-19 23:36:39,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:39,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:39,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205345843] [2019-11-19 23:36:39,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:39,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:39,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:39,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:39,208 INFO L87 Difference]: Start difference. First operand 2254 states and 3412 transitions. Second operand 4 states. [2019-11-19 23:36:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:39,585 INFO L93 Difference]: Finished difference Result 4953 states and 7446 transitions. [2019-11-19 23:36:39,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:39,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-19 23:36:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:39,588 INFO L225 Difference]: With dead ends: 4953 [2019-11-19 23:36:39,588 INFO L226 Difference]: Without dead ends: 2718 [2019-11-19 23:36:39,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-11-19 23:36:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2261. [2019-11-19 23:36:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-11-19 23:36:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3419 transitions. [2019-11-19 23:36:39,640 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3419 transitions. Word has length 195 [2019-11-19 23:36:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:39,640 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 3419 transitions. [2019-11-19 23:36:39,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3419 transitions. [2019-11-19 23:36:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-19 23:36:39,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:39,644 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:39,644 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1513066831, now seen corresponding path program 1 times [2019-11-19 23:36:39,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:39,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963675614] [2019-11-19 23:36:39,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:39,951 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-19 23:36:39,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963675614] [2019-11-19 23:36:39,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:39,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 23:36:39,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117363656] [2019-11-19 23:36:39,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:36:39,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:36:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:36:39,952 INFO L87 Difference]: Start difference. First operand 2261 states and 3419 transitions. Second operand 9 states. [2019-11-19 23:36:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:42,237 INFO L93 Difference]: Finished difference Result 9551 states and 14445 transitions. [2019-11-19 23:36:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:36:42,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-11-19 23:36:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:42,243 INFO L225 Difference]: With dead ends: 9551 [2019-11-19 23:36:42,243 INFO L226 Difference]: Without dead ends: 7309 [2019-11-19 23:36:42,246 INFO L630 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-19 23:36:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2019-11-19 23:36:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 3486. [2019-11-19 23:36:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-11-19 23:36:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5621 transitions. [2019-11-19 23:36:42,327 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5621 transitions. Word has length 199 [2019-11-19 23:36:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:42,327 INFO L462 AbstractCegarLoop]: Abstraction has 3486 states and 5621 transitions. [2019-11-19 23:36:42,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:36:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5621 transitions. [2019-11-19 23:36:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-19 23:36:42,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:42,331 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:42,331 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1894677619, now seen corresponding path program 1 times [2019-11-19 23:36:42,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:42,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811118053] [2019-11-19 23:36:42,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:42,517 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-19 23:36:42,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811118053] [2019-11-19 23:36:42,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:42,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:36:42,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432399221] [2019-11-19 23:36:42,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:36:42,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:36:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:42,519 INFO L87 Difference]: Start difference. First operand 3486 states and 5621 transitions. Second operand 7 states. [2019-11-19 23:36:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:44,213 INFO L93 Difference]: Finished difference Result 11425 states and 18122 transitions. [2019-11-19 23:36:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:36:44,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-11-19 23:36:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:44,218 INFO L225 Difference]: With dead ends: 11425 [2019-11-19 23:36:44,219 INFO L226 Difference]: Without dead ends: 7958 [2019-11-19 23:36:44,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:36:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2019-11-19 23:36:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 4585. [2019-11-19 23:36:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4585 states. [2019-11-19 23:36:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 7582 transitions. [2019-11-19 23:36:44,323 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 7582 transitions. Word has length 199 [2019-11-19 23:36:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:44,324 INFO L462 AbstractCegarLoop]: Abstraction has 4585 states and 7582 transitions. [2019-11-19 23:36:44,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:36:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 7582 transitions. [2019-11-19 23:36:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-19 23:36:44,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:44,328 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:44,328 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash 940730833, now seen corresponding path program 1 times [2019-11-19 23:36:44,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:44,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031888332] [2019-11-19 23:36:44,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:44,552 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-19 23:36:44,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031888332] [2019-11-19 23:36:44,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:44,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 23:36:44,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377188920] [2019-11-19 23:36:44,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:36:44,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:44,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:36:44,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:36:44,555 INFO L87 Difference]: Start difference. First operand 4585 states and 7582 transitions. Second operand 8 states. [2019-11-19 23:36:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:46,007 INFO L93 Difference]: Finished difference Result 10823 states and 17497 transitions. [2019-11-19 23:36:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:36:46,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2019-11-19 23:36:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:46,013 INFO L225 Difference]: With dead ends: 10823 [2019-11-19 23:36:46,013 INFO L226 Difference]: Without dead ends: 6257 [2019-11-19 23:36:46,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:36:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2019-11-19 23:36:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 4053. [2019-11-19 23:36:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-11-19 23:36:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6647 transitions. [2019-11-19 23:36:46,101 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6647 transitions. Word has length 200 [2019-11-19 23:36:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:46,101 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 6647 transitions. [2019-11-19 23:36:46,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:36:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6647 transitions. [2019-11-19 23:36:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-19 23:36:46,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:46,106 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:46,106 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1620132013, now seen corresponding path program 1 times [2019-11-19 23:36:46,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:46,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576505863] [2019-11-19 23:36:46,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:46,321 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-19 23:36:46,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576505863] [2019-11-19 23:36:46,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:46,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:36:46,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315562994] [2019-11-19 23:36:46,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:36:46,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:36:46,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:46,323 INFO L87 Difference]: Start difference. First operand 4053 states and 6647 transitions. Second operand 7 states. [2019-11-19 23:36:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:48,162 INFO L93 Difference]: Finished difference Result 11131 states and 17662 transitions. [2019-11-19 23:36:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:36:48,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-11-19 23:36:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:48,167 INFO L225 Difference]: With dead ends: 11131 [2019-11-19 23:36:48,167 INFO L226 Difference]: Without dead ends: 7097 [2019-11-19 23:36:48,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:36:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2019-11-19 23:36:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 4060. [2019-11-19 23:36:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6640 transitions. [2019-11-19 23:36:48,255 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6640 transitions. Word has length 200 [2019-11-19 23:36:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:48,256 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6640 transitions. [2019-11-19 23:36:48,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:36:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6640 transitions. [2019-11-19 23:36:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-19 23:36:48,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:48,260 INFO L410 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-19 23:36:48,260 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -606545911, now seen corresponding path program 1 times [2019-11-19 23:36:48,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:48,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032453839] [2019-11-19 23:36:48,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:48,358 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-19 23:36:48,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032453839] [2019-11-19 23:36:48,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:48,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:48,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322018582] [2019-11-19 23:36:48,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:48,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:48,360 INFO L87 Difference]: Start difference. First operand 4060 states and 6640 transitions. Second operand 4 states. [2019-11-19 23:36:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:48,968 INFO L93 Difference]: Finished difference Result 8530 states and 13842 transitions. [2019-11-19 23:36:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:48,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-19 23:36:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:48,973 INFO L225 Difference]: With dead ends: 8530 [2019-11-19 23:36:48,974 INFO L226 Difference]: Without dead ends: 4489 [2019-11-19 23:36:48,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-19 23:36:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4060. [2019-11-19 23:36:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6633 transitions. [2019-11-19 23:36:49,097 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6633 transitions. Word has length 207 [2019-11-19 23:36:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:49,098 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6633 transitions. [2019-11-19 23:36:49,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6633 transitions. [2019-11-19 23:36:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 23:36:49,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:49,102 INFO L410 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-19 23:36:49,102 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2073605104, now seen corresponding path program 1 times [2019-11-19 23:36:49,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:49,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741962361] [2019-11-19 23:36:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-19 23:36:49,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741962361] [2019-11-19 23:36:49,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:49,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:49,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994514061] [2019-11-19 23:36:49,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:49,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:49,220 INFO L87 Difference]: Start difference. First operand 4060 states and 6633 transitions. Second operand 4 states. [2019-11-19 23:36:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:49,635 INFO L93 Difference]: Finished difference Result 8516 states and 13814 transitions. [2019-11-19 23:36:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:49,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-19 23:36:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:49,638 INFO L225 Difference]: With dead ends: 8516 [2019-11-19 23:36:49,638 INFO L226 Difference]: Without dead ends: 4475 [2019-11-19 23:36:49,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-11-19 23:36:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4060. [2019-11-19 23:36:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6626 transitions. [2019-11-19 23:36:49,728 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6626 transitions. Word has length 208 [2019-11-19 23:36:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:49,728 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6626 transitions. [2019-11-19 23:36:49,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6626 transitions. [2019-11-19 23:36:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 23:36:49,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:49,732 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:36:49,732 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1533459632, now seen corresponding path program 1 times [2019-11-19 23:36:49,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:49,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21343247] [2019-11-19 23:36:49,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:49,828 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-19 23:36:49,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21343247] [2019-11-19 23:36:49,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:49,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83599637] [2019-11-19 23:36:49,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:49,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:49,830 INFO L87 Difference]: Start difference. First operand 4060 states and 6626 transitions. Second operand 4 states. [2019-11-19 23:36:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:50,338 INFO L93 Difference]: Finished difference Result 8635 states and 13948 transitions. [2019-11-19 23:36:50,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:50,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-19 23:36:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:50,342 INFO L225 Difference]: With dead ends: 8635 [2019-11-19 23:36:50,342 INFO L226 Difference]: Without dead ends: 4594 [2019-11-19 23:36:50,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-11-19 23:36:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4060. [2019-11-19 23:36:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6612 transitions. [2019-11-19 23:36:50,432 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6612 transitions. Word has length 208 [2019-11-19 23:36:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:50,432 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6612 transitions. [2019-11-19 23:36:50,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6612 transitions. [2019-11-19 23:36:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-19 23:36:50,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:50,437 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:36:50,437 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:50,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2096029627, now seen corresponding path program 1 times [2019-11-19 23:36:50,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:50,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753274613] [2019-11-19 23:36:50,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:50,592 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-19 23:36:50,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753274613] [2019-11-19 23:36:50,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:50,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:50,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668617032] [2019-11-19 23:36:50,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:50,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:50,595 INFO L87 Difference]: Start difference. First operand 4060 states and 6612 transitions. Second operand 4 states. [2019-11-19 23:36:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:51,055 INFO L93 Difference]: Finished difference Result 8579 states and 13829 transitions. [2019-11-19 23:36:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:51,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-19 23:36:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:51,062 INFO L225 Difference]: With dead ends: 8579 [2019-11-19 23:36:51,063 INFO L226 Difference]: Without dead ends: 4538 [2019-11-19 23:36:51,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2019-11-19 23:36:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 4060. [2019-11-19 23:36:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6598 transitions. [2019-11-19 23:36:51,169 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6598 transitions. Word has length 209 [2019-11-19 23:36:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:51,170 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6598 transitions. [2019-11-19 23:36:51,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6598 transitions. [2019-11-19 23:36:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-19 23:36:51,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:51,174 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:51,174 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1669270075, now seen corresponding path program 1 times [2019-11-19 23:36:51,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:51,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721865508] [2019-11-19 23:36:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:51,275 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-19 23:36:51,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721865508] [2019-11-19 23:36:51,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:51,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:51,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977977783] [2019-11-19 23:36:51,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:51,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:51,277 INFO L87 Difference]: Start difference. First operand 4060 states and 6598 transitions. Second operand 4 states. [2019-11-19 23:36:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:51,777 INFO L93 Difference]: Finished difference Result 8516 states and 13744 transitions. [2019-11-19 23:36:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:51,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-19 23:36:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:51,785 INFO L225 Difference]: With dead ends: 8516 [2019-11-19 23:36:51,785 INFO L226 Difference]: Without dead ends: 4475 [2019-11-19 23:36:51,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-11-19 23:36:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4060. [2019-11-19 23:36:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6591 transitions. [2019-11-19 23:36:51,899 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6591 transitions. Word has length 209 [2019-11-19 23:36:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:51,900 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6591 transitions. [2019-11-19 23:36:51,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6591 transitions. [2019-11-19 23:36:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-19 23:36:51,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:51,904 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:51,904 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -534944436, now seen corresponding path program 1 times [2019-11-19 23:36:51,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:51,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399579056] [2019-11-19 23:36:51,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,010 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-19 23:36:52,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399579056] [2019-11-19 23:36:52,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:52,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247138311] [2019-11-19 23:36:52,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:52,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:52,012 INFO L87 Difference]: Start difference. First operand 4060 states and 6591 transitions. Second operand 4 states. [2019-11-19 23:36:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:52,698 INFO L93 Difference]: Finished difference Result 8516 states and 13730 transitions. [2019-11-19 23:36:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:52,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-19 23:36:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:52,702 INFO L225 Difference]: With dead ends: 8516 [2019-11-19 23:36:52,702 INFO L226 Difference]: Without dead ends: 4475 [2019-11-19 23:36:52,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-11-19 23:36:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4060. [2019-11-19 23:36:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6584 transitions. [2019-11-19 23:36:52,824 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6584 transitions. Word has length 210 [2019-11-19 23:36:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:52,824 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6584 transitions. [2019-11-19 23:36:52,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6584 transitions. [2019-11-19 23:36:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-19 23:36:52,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:52,828 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:52,828 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1012622592, now seen corresponding path program 1 times [2019-11-19 23:36:52,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:52,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472079831] [2019-11-19 23:36:52,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,943 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-19 23:36:52,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472079831] [2019-11-19 23:36:52,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:52,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806604370] [2019-11-19 23:36:52,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:52,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:52,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:52,945 INFO L87 Difference]: Start difference. First operand 4060 states and 6584 transitions. Second operand 4 states. [2019-11-19 23:36:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:53,736 INFO L93 Difference]: Finished difference Result 8516 states and 13716 transitions. [2019-11-19 23:36:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:53,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-19 23:36:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:53,741 INFO L225 Difference]: With dead ends: 8516 [2019-11-19 23:36:53,742 INFO L226 Difference]: Without dead ends: 4475 [2019-11-19 23:36:53,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-11-19 23:36:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4060. [2019-11-19 23:36:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6577 transitions. [2019-11-19 23:36:53,896 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6577 transitions. Word has length 211 [2019-11-19 23:36:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:53,897 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6577 transitions. [2019-11-19 23:36:53,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6577 transitions. [2019-11-19 23:36:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-19 23:36:53,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:53,902 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:53,902 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 77189159, now seen corresponding path program 1 times [2019-11-19 23:36:53,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:53,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506302114] [2019-11-19 23:36:53,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:54,049 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-19 23:36:54,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506302114] [2019-11-19 23:36:54,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:54,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:54,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957639656] [2019-11-19 23:36:54,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:54,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:54,052 INFO L87 Difference]: Start difference. First operand 4060 states and 6577 transitions. Second operand 4 states. [2019-11-19 23:36:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:54,806 INFO L93 Difference]: Finished difference Result 8446 states and 13618 transitions. [2019-11-19 23:36:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:54,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-19 23:36:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:54,810 INFO L225 Difference]: With dead ends: 8446 [2019-11-19 23:36:54,810 INFO L226 Difference]: Without dead ends: 4405 [2019-11-19 23:36:54,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2019-11-19 23:36:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4060. [2019-11-19 23:36:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-11-19 23:36:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6570 transitions. [2019-11-19 23:36:54,937 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6570 transitions. Word has length 212 [2019-11-19 23:36:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:54,937 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 6570 transitions. [2019-11-19 23:36:54,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6570 transitions. [2019-11-19 23:36:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-19 23:36:54,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:54,941 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:54,941 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -11911447, now seen corresponding path program 1 times [2019-11-19 23:36:54,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:54,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97192722] [2019-11-19 23:36:54,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,105 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-19 23:36:55,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97192722] [2019-11-19 23:36:55,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:55,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711514986] [2019-11-19 23:36:55,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:55,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:55,107 INFO L87 Difference]: Start difference. First operand 4060 states and 6570 transitions. Second operand 5 states. [2019-11-19 23:36:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:55,751 INFO L93 Difference]: Finished difference Result 8985 states and 14447 transitions. [2019-11-19 23:36:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:55,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-11-19 23:36:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:55,757 INFO L225 Difference]: With dead ends: 8985 [2019-11-19 23:36:55,757 INFO L226 Difference]: Without dead ends: 4944 [2019-11-19 23:36:55,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:36:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-11-19 23:36:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4319. [2019-11-19 23:36:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-11-19 23:36:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 7032 transitions. [2019-11-19 23:36:55,857 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 7032 transitions. Word has length 214 [2019-11-19 23:36:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:55,857 INFO L462 AbstractCegarLoop]: Abstraction has 4319 states and 7032 transitions. [2019-11-19 23:36:55,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 7032 transitions. [2019-11-19 23:36:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-19 23:36:55,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:55,860 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 23:36:55,860 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 911044471, now seen corresponding path program 1 times [2019-11-19 23:36:55,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:55,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117462995] [2019-11-19 23:36:55,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,962 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-19 23:36:55,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117462995] [2019-11-19 23:36:55,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:55,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512117168] [2019-11-19 23:36:55,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:55,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:55,963 INFO L87 Difference]: Start difference. First operand 4319 states and 7032 transitions. Second operand 5 states. [2019-11-19 23:36:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:56,441 INFO L93 Difference]: Finished difference Result 9230 states and 14874 transitions. [2019-11-19 23:36:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:56,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2019-11-19 23:36:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:56,446 INFO L225 Difference]: With dead ends: 9230 [2019-11-19 23:36:56,446 INFO L226 Difference]: Without dead ends: 4930 [2019-11-19 23:36:56,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:36:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4930 states. [2019-11-19 23:36:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4930 to 4256. [2019-11-19 23:36:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4256 states. [2019-11-19 23:36:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 6906 transitions. [2019-11-19 23:36:56,572 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 6906 transitions. Word has length 215 [2019-11-19 23:36:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:56,572 INFO L462 AbstractCegarLoop]: Abstraction has 4256 states and 6906 transitions. [2019-11-19 23:36:56,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 6906 transitions. [2019-11-19 23:36:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-19 23:36:56,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:56,576 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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-19 23:36:56,577 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1214559478, now seen corresponding path program 1 times [2019-11-19 23:36:56,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:56,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70120545] [2019-11-19 23:36:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:57,078 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-19 23:36:57,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70120545] [2019-11-19 23:36:57,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724606651] [2019-11-19 23:36:57,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:36:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:57,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 23:36:57,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:36:57,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-19 23:36:57,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,554 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-19 23:36:57,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:57,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-19 23:36:57,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,657 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-19 23:36:57,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,770 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:36:57,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-19 23:36:57,771 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,788 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-19 23:36:57,788 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-19 23:36:57,872 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:36:57,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:36:57,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:36:57,929 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:36:57,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:36:57,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:57,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:36:57,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:36:57,946 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-19 23:36:57,949 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-19 23:36:57,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,031 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:36:58,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-19 23:36:58,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-19 23:36:58,102 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:36:58,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:36:58,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:36:58,148 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:36:58,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:36:58,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:36:58,171 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-19 23:36:58,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:36:58,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-19 23:36:58,177 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-19 23:36:58,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,356 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-19 23:36:58,357 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-19 23:36:58,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-19 23:36:58,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:58,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,400 INFO L496 ElimStorePlain]: Start of recursive call 3: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-11-19 23:36:58,577 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 62 [2019-11-19 23:36:58,577 INFO L567 ElimStorePlain]: treesize reduction 2426, result has 8.5 percent of original size [2019-11-19 23:36:58,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-19 23:36:58,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:233 [2019-11-19 23:36:58,706 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-19 23:36:58,710 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-19 23:36:58,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:58,899 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-19 23:36:58,899 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-19 23:36:58,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-19 23:36:58,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:58,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:58,935 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-19 23:36:58,936 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-19 23:36:58,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-19 23:36:59,114 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-11-19 23:36:59,114 INFO L343 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-19 23:36:59,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-19 23:36:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:59,145 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-19 23:36:59,145 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-19 23:36:59,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-19 23:36:59,148 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_159|], 30=[|v_#memory_$Pointer$.base_171|]} [2019-11-19 23:36:59,153 INFO L377 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-19 23:36:59,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:59,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:59,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-19 23:36:59,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:36:59,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:36:59,484 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-11-19 23:36:59,485 INFO L343 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-19 23:36:59,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-19 23:36:59,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:00,996 INFO L496 ElimStorePlain]: Start of recursive call 4: 224 dim-0 vars, End of recursive call: 224 dim-0 vars, and 1 xjuncts. [2019-11-19 23:37:10,984 WARN L191 SmtUtils]: Spent 9.98 s on a formula simplification. DAG size of input: 3461 DAG size of output: 47 [2019-11-19 23:37:10,984 INFO L567 ElimStorePlain]: treesize reduction 46113, result has 0.3 percent of original size [2019-11-19 23:37:10,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:10,985 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:74 [2019-11-19 23:37:11,032 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_179|, |v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-19 23:37:11,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-19 23:37:11,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-19 23:37:11,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2019-11-19 23:37:11,110 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,124 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-19 23:37:11,188 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_173|, |v_#memory_int_180|]} [2019-11-19 23:37:11,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-11-19 23:37:11,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-19 23:37:11,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:11,224 INFO L377 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-19 23:37:11,224 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-19 23:37:11,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,254 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-19 23:37:11,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2019-11-19 23:37:11,254 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,264 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-19 23:37:11,264 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:32 [2019-11-19 23:37:11,318 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:37:11,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-19 23:37:11,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:11,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:11,323 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-19 23:37:11,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-19 23:37:11,737 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-19 23:37:11,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:37:11,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-11-19 23:37:11,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404860793] [2019-11-19 23:37:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:37:11,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:37:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:37:11,740 INFO L87 Difference]: Start difference. First operand 4256 states and 6906 transitions. Second operand 16 states. [2019-11-19 23:37:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:19,338 INFO L93 Difference]: Finished difference Result 24302 states and 38071 transitions. [2019-11-19 23:37:19,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 23:37:19,339 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 228 [2019-11-19 23:37:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:19,377 INFO L225 Difference]: With dead ends: 24302 [2019-11-19 23:37:19,377 INFO L226 Difference]: Without dead ends: 20065 [2019-11-19 23:37:19,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 23:37:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20065 states. [2019-11-19 23:37:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20065 to 10864. [2019-11-19 23:37:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10864 states. [2019-11-19 23:37:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 17594 transitions. [2019-11-19 23:37:19,907 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 17594 transitions. Word has length 228 [2019-11-19 23:37:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:19,907 INFO L462 AbstractCegarLoop]: Abstraction has 10864 states and 17594 transitions. [2019-11-19 23:37:19,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:37:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 17594 transitions. [2019-11-19 23:37:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-19 23:37:19,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:19,919 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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-19 23:37:20,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:20,124 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1047013772, now seen corresponding path program 1 times [2019-11-19 23:37:20,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:20,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918473400] [2019-11-19 23:37:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:20,557 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-19 23:37:20,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918473400] [2019-11-19 23:37:20,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140571954] [2019-11-19 23:37:20,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:20,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-19 23:37:20,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:20,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:20,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-19 23:37:20,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:20,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:20,969 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.base_174|]} [2019-11-19 23:37:20,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:20,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-19 23:37:20,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,017 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-19 23:37:21,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,082 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:37:21,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-19 23:37:21,083 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,097 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-19 23:37:21,097 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-19 23:37:21,136 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:21,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:21,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:21,172 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:21,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:21,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:21,187 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-11-19 23:37:21,189 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-19 23:37:21,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,257 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:37:21,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-19 23:37:21,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-19 23:37:21,306 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_181|], 12=[|v_#memory_$Pointer$.base_181|]} [2019-11-19 23:37:21,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-19 23:37:21,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:21,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2019-11-19 23:37:21,386 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_182|], 12=[|v_#memory_$Pointer$.base_182|]} [2019-11-19 23:37:21,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-19 23:37:21,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:21,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:81 [2019-11-19 23:37:21,463 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_183|], 12=[|v_#memory_int_183|]} [2019-11-19 23:37:21,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-19 23:37:21,467 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-19 23:37:21,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:21,487 INFO L377 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-19 23:37:21,488 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-19 23:37:21,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,503 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-19 23:37:21,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-19 23:37:21,504 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,511 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:29 [2019-11-19 23:37:21,555 INFO L343 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2019-11-19 23:37:21,555 INFO L377 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-19 23:37:21,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:29 [2019-11-19 23:37:21,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-19 23:37:21,594 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-19 23:37:21,594 INFO L377 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-19 23:37:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:21,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 23:37:21,603 INFO L567 ElimStorePlain]: treesize reduction 21, result has 16.0 percent of original size [2019-11-19 23:37:21,604 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:21,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:21,606 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-19 23:37:21,606 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:4 [2019-11-19 23:37:21,809 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-19 23:37:21,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:37:21,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-19 23:37:21,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303356143] [2019-11-19 23:37:21,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 23:37:21,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 23:37:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:37:21,811 INFO L87 Difference]: Start difference. First operand 10864 states and 17594 transitions. Second operand 14 states. [2019-11-19 23:37:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:24,742 INFO L93 Difference]: Finished difference Result 29499 states and 47366 transitions. [2019-11-19 23:37:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:37:24,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2019-11-19 23:37:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:24,760 INFO L225 Difference]: With dead ends: 29499 [2019-11-19 23:37:24,760 INFO L226 Difference]: Without dead ends: 18654 [2019-11-19 23:37:24,770 INFO L630 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-19 23:37:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18654 states. [2019-11-19 23:37:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18654 to 16261. [2019-11-19 23:37:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-11-19 23:37:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 26286 transitions. [2019-11-19 23:37:25,295 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 26286 transitions. Word has length 228 [2019-11-19 23:37:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:25,295 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 26286 transitions. [2019-11-19 23:37:25,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 23:37:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 26286 transitions. [2019-11-19 23:37:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-19 23:37:25,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:25,306 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-19 23:37:25,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:25,510 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2011306122, now seen corresponding path program 1 times [2019-11-19 23:37:25,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:25,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100450996] [2019-11-19 23:37:25,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:26,107 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-19 23:37:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100450996] [2019-11-19 23:37:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812344828] [2019-11-19 23:37:26,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:26,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 23:37:26,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:26,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-19 23:37:26,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,404 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_188|], 2=[|v_#memory_$Pointer$.base_185|, |v_#memory_$Pointer$.base_184|]} [2019-11-19 23:37:26,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-19 23:37:26,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,456 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-19 23:37:26,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,518 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:37:26,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-19 23:37:26,518 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,531 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-19 23:37:26,531 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-19 23:37:26,573 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:26,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:26,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:26,623 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:26,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:26,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:26,635 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_186|], 12=[|v_#memory_$Pointer$.base_191|]} [2019-11-19 23:37:26,636 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-19 23:37:26,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,708 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:37:26,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-19 23:37:26,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-19 23:37:26,762 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:26,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:26,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:26,807 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:37:26,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:37:26,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:26,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:37:26,824 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|], 20=[|v_#memory_$Pointer$.base_194|]} [2019-11-19 23:37:26,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:26,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-19 23:37:26,827 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-19 23:37:26,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:26,979 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-19 23:37:26,979 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-19 23:37:26,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-19 23:37:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-19 23:37:27,262 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 34 [2019-11-19 23:37:27,262 INFO L567 ElimStorePlain]: treesize reduction 10312, result has 0.8 percent of original size [2019-11-19 23:37:27,263 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-19 23:37:27,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2019-11-19 23:37:27,293 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 30=[|v_#memory_$Pointer$.base_195|]} [2019-11-19 23:37:27,295 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-19 23:37:27,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:27,458 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-19 23:37:27,458 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-19 23:37:27,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-19 23:37:27,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:27,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:27,488 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-19 23:37:27,488 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-19 23:37:27,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-19 23:37:27,643 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-11-19 23:37:27,643 INFO L343 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-19 23:37:27,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-19 23:37:27,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:27,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:27,676 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-19 23:37:27,676 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-19 23:37:27,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-19 23:37:27,679 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_186|], 2=[|v_#memory_$Pointer$.offset_164|], 30=[|v_#memory_$Pointer$.base_197|]} [2019-11-19 23:37:27,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-19 23:37:27,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:27,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:27,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-19 23:37:27,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:27,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,051 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-11-19 23:37:28,051 INFO L343 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-19 23:37:28,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-19 23:37:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,134 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2019-11-19 23:37:28,570 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 59 [2019-11-19 23:37:28,570 INFO L567 ElimStorePlain]: treesize reduction 15648, result has 2.4 percent of original size [2019-11-19 23:37:28,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,572 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 2 xjuncts. [2019-11-19 23:37:28,572 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:380 [2019-11-19 23:37:28,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:28,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:28,647 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_187|, |v_#memory_$Pointer$.offset_165|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-11-19 23:37:28,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-19 23:37:28,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-19 23:37:28,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2019-11-19 23:37:28,729 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,743 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-19 23:37:28,792 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|], 6=[|v_#memory_$Pointer$.base_199|, |v_#memory_int_188|]} [2019-11-19 23:37:28,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-11-19 23:37:28,796 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-19 23:37:28,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:28,821 INFO L377 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-19 23:37:28,821 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-19 23:37:28,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,842 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-19 23:37:28,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2019-11-19 23:37:28,843 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,850 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-19 23:37:28,850 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:38 [2019-11-19 23:37:28,895 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:37:28,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2019-11-19 23:37:28,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:28,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:28,901 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-19 23:37:28,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2019-11-19 23:37:29,265 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-19 23:37:29,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:37:29,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-19 23:37:29,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638593716] [2019-11-19 23:37:29,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 23:37:29,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 23:37:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:37:29,267 INFO L87 Difference]: Start difference. First operand 16261 states and 26286 transitions. Second operand 15 states. [2019-11-19 23:37:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:34,960 INFO L93 Difference]: Finished difference Result 45478 states and 72187 transitions. [2019-11-19 23:37:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 23:37:34,960 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 229 [2019-11-19 23:37:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:34,986 INFO L225 Difference]: With dead ends: 45478 [2019-11-19 23:37:34,987 INFO L226 Difference]: Without dead ends: 29236 [2019-11-19 23:37:34,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2019-11-19 23:37:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29236 states. [2019-11-19 23:37:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29236 to 16135. [2019-11-19 23:37:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16135 states. [2019-11-19 23:37:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16135 states to 16135 states and 26048 transitions. [2019-11-19 23:37:35,546 INFO L78 Accepts]: Start accepts. Automaton has 16135 states and 26048 transitions. Word has length 229 [2019-11-19 23:37:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:35,546 INFO L462 AbstractCegarLoop]: Abstraction has 16135 states and 26048 transitions. [2019-11-19 23:37:35,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 23:37:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16135 states and 26048 transitions. [2019-11-19 23:37:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-19 23:37:35,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:35,559 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-19 23:37:35,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:35,762 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash 408818485, now seen corresponding path program 1 times [2019-11-19 23:37:35,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:35,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733722783] [2019-11-19 23:37:35,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:35,973 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-19 23:37:35,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733722783] [2019-11-19 23:37:35,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381487510] [2019-11-19 23:37:35,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:36,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:37:36,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:36,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 23:37:36,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:37:36,224 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_200|, |v_#memory_$Pointer$.offset_167|], 2=[|v_#memory_int_190|]} [2019-11-19 23:37:36,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-19 23:37:36,227 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-19 23:37:36,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-11-19 23:37:36,238 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-19 23:37:36,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-19 23:37:36,269 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,304 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-19 23:37:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:36,305 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-19 23:37:36,305 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-19 23:37:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:36,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:36,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-19 23:37:36,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:36,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:37:36,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,440 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-19 23:37:36,441 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-19 23:37:36,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-19 23:37:36,525 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:37:36,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-19 23:37:36,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:36,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:36,527 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-19 23:37:36,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:37:36,579 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-19 23:37:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:37:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2019-11-19 23:37:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5984520] [2019-11-19 23:37:36,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:37:36,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:36,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:37:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:37:36,580 INFO L87 Difference]: Start difference. First operand 16135 states and 26048 transitions. Second operand 8 states. [2019-11-19 23:37:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:38,833 INFO L93 Difference]: Finished difference Result 35543 states and 56771 transitions. [2019-11-19 23:37:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:37:38,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 231 [2019-11-19 23:37:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:38,848 INFO L225 Difference]: With dead ends: 35543 [2019-11-19 23:37:38,848 INFO L226 Difference]: Without dead ends: 19427 [2019-11-19 23:37:38,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-11-19 23:37:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19427 states. [2019-11-19 23:37:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19427 to 16730. [2019-11-19 23:37:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16730 states. [2019-11-19 23:37:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16730 states to 16730 states and 27070 transitions. [2019-11-19 23:37:39,367 INFO L78 Accepts]: Start accepts. Automaton has 16730 states and 27070 transitions. Word has length 231 [2019-11-19 23:37:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:39,367 INFO L462 AbstractCegarLoop]: Abstraction has 16730 states and 27070 transitions. [2019-11-19 23:37:39,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:37:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16730 states and 27070 transitions. [2019-11-19 23:37:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-19 23:37:39,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:39,377 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-19 23:37:39,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:39,577 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1962803991, now seen corresponding path program 1 times [2019-11-19 23:37:39,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:39,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850355191] [2019-11-19 23:37:39,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:39,803 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-19 23:37:39,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850355191] [2019-11-19 23:37:39,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232260231] [2019-11-19 23:37:39,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:40,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:37:40,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:40,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 23:37:40,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:37:40,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_168|, |v_#memory_$Pointer$.base_201|], 2=[|v_#memory_int_193|]} [2019-11-19 23:37:40,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-19 23:37:40,047 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-19 23:37:40,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 23:37:40,061 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-19 23:37:40,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-19 23:37:40,096 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,121 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-19 23:37:40,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:40,121 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-19 23:37:40,122 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-19 23:37:40,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:40,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:40,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:40,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:37:40,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:40,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-19 23:37:40,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,214 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-19 23:37:40,214 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-19 23:37:40,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-19 23:37:40,295 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:37:40,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-19 23:37:40,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:40,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:40,297 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-19 23:37:40,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:37:40,346 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-19 23:37:40,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:37:40,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2019-11-19 23:37:40,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562074789] [2019-11-19 23:37:40,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:37:40,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:37:40,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:37:40,348 INFO L87 Difference]: Start difference. First operand 16730 states and 27070 transitions. Second operand 8 states. [2019-11-19 23:37:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:42,528 INFO L93 Difference]: Finished difference Result 36068 states and 57639 transitions. [2019-11-19 23:37:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:37:42,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-11-19 23:37:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:42,541 INFO L225 Difference]: With dead ends: 36068 [2019-11-19 23:37:42,542 INFO L226 Difference]: Without dead ends: 19357 [2019-11-19 23:37:42,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-11-19 23:37:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19357 states. [2019-11-19 23:37:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19357 to 16758. [2019-11-19 23:37:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16758 states. [2019-11-19 23:37:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16758 states to 16758 states and 27077 transitions. [2019-11-19 23:37:43,047 INFO L78 Accepts]: Start accepts. Automaton has 16758 states and 27077 transitions. Word has length 232 [2019-11-19 23:37:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:43,047 INFO L462 AbstractCegarLoop]: Abstraction has 16758 states and 27077 transitions. [2019-11-19 23:37:43,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:37:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16758 states and 27077 transitions. [2019-11-19 23:37:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-19 23:37:43,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:43,056 INFO L410 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-19 23:37:43,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:43,257 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1687624652, now seen corresponding path program 1 times [2019-11-19 23:37:43,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:43,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120774981] [2019-11-19 23:37:43,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:43,468 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-19 23:37:43,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120774981] [2019-11-19 23:37:43,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100560041] [2019-11-19 23:37:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:43,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-19 23:37:43,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:43,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 23:37:43,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:37:43,705 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_169|], 2=[|v_#memory_int_196|, |v_#memory_$Pointer$.base_202|]} [2019-11-19 23:37:43,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-19 23:37:43,708 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-19 23:37:43,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 74 [2019-11-19 23:37:43,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,760 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.1 percent of original size [2019-11-19 23:37:43,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 98 [2019-11-19 23:37:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,778 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-19 23:37:43,823 INFO L567 ElimStorePlain]: treesize reduction 137, result has 33.8 percent of original size [2019-11-19 23:37:43,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-19 23:37:43,824 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:55 [2019-11-19 23:37:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:43,860 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_197|]} [2019-11-19 23:37:43,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2019-11-19 23:37:43,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2019-11-19 23:37:43,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-19 23:37:43,885 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:43,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 114 [2019-11-19 23:37:43,964 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-19 23:37:43,983 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:43,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:43,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-11-19 23:37:43,991 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:44,068 INFO L567 ElimStorePlain]: treesize reduction 53, result has 67.3 percent of original size [2019-11-19 23:37:44,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-19 23:37:44,068 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:160, output treesize:101 [2019-11-19 23:37:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:44,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:44,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2019-11-19 23:37:44,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:44,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,430 INFO L377 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 37 treesize of output 13 [2019-11-19 23:37:44,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:44,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2019-11-19 23:37:44,437 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:44,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:37:44,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2019-11-19 23:37:44,442 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:44,467 INFO L567 ElimStorePlain]: treesize reduction 58, result has 22.7 percent of original size [2019-11-19 23:37:44,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 23:37:44,467 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:17 [2019-11-19 23:37:44,558 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-19 23:37:44,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:37:44,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-19 23:37:44,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594800510] [2019-11-19 23:37:44,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:37:44,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:37:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:44,560 INFO L87 Difference]: Start difference. First operand 16758 states and 27077 transitions. Second operand 6 states. [2019-11-19 23:37:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:46,938 INFO L93 Difference]: Finished difference Result 35368 states and 56639 transitions. [2019-11-19 23:37:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:46,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-11-19 23:37:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:46,952 INFO L225 Difference]: With dead ends: 35368 [2019-11-19 23:37:46,952 INFO L226 Difference]: Without dead ends: 18629 [2019-11-19 23:37:46,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 233 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:37:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18629 states. [2019-11-19 23:37:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18629 to 16758. [2019-11-19 23:37:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16758 states. [2019-11-19 23:37:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16758 states to 16758 states and 27035 transitions. [2019-11-19 23:37:47,498 INFO L78 Accepts]: Start accepts. Automaton has 16758 states and 27035 transitions. Word has length 241 [2019-11-19 23:37:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:47,499 INFO L462 AbstractCegarLoop]: Abstraction has 16758 states and 27035 transitions. [2019-11-19 23:37:47,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:37:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16758 states and 27035 transitions. [2019-11-19 23:37:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-19 23:37:47,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:47,511 INFO L410 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-19 23:37:47,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:47,712 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1266982991, now seen corresponding path program 1 times [2019-11-19 23:37:47,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:47,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001491525] [2019-11-19 23:37:47,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:48,150 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-19 23:37:48,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001491525] [2019-11-19 23:37:48,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273516715] [2019-11-19 23:37:48,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:48,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-19 23:37:48,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:48,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 23:37:48,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:37:48,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:48,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:37:48,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:37:48,355 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_170|], 2=[|v_#memory_$Pointer$.base_204|, |v_#memory_int_199|]} [2019-11-19 23:37:48,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-19 23:37:48,358 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-19 23:37:48,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:48,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:48,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 81 [2019-11-19 23:37:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-19 23:37:48,420 INFO L567 ElimStorePlain]: treesize reduction 129, result has 30.6 percent of original size [2019-11-19 23:37:48,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:37:48,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 133 [2019-11-19 23:37:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:37:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:37:48,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:48,655 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-19 23:37:48,657 INFO L168 Benchmark]: Toolchain (without parser) took 100158.29 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 943.4 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 310.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:48,658 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:37:48,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:48,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:37:48,659 INFO L168 Benchmark]: Boogie Preprocessor took 114.58 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:48,659 INFO L168 Benchmark]: RCFGBuilder took 1203.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:48,659 INFO L168 Benchmark]: TraceAbstraction took 98056.75 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 970.4 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:48,661 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.58 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1203.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98056.75 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 970.4 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 224.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-678e011 [2019-11-19 23:37:50,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:37:50,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:37:50,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:37:50,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:37:50,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:37:50,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:37:50,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:37:50,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:37:50,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:37:50,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:37:50,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:37:50,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:37:50,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:37:50,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:37:50,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:37:50,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:37:50,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:37:50,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:37:50,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:37:50,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:37:50,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:37:50,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:37:50,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:37:50,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:37:50,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:37:50,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:37:50,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:37:50,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:37:50,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:37:50,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:37:50,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:37:50,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:37:50,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:37:50,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:37:50,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:37:50,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:37:50,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:37:50,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:37:50,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:37:50,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:37:50,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 23:37:50,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:37:50,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:37:50,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:37:50,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:37:50,603 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:37:50,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:37:50,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:37:50,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:37:50,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:37:50,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:37:50,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:37:50,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:37:50,605 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 23:37:50,605 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 23:37:50,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:37:50,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:37:50,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:37:50,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:37:50,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:37:50,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:37:50,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:37:50,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:37:50,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:37:50,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:37:50,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:37:50,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:37:50,608 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 23:37:50,608 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 23:37:50,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:37:50,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:37:50,609 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_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:50,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:37:50,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:37:50,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:37:50,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:37:50,907 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:37:50,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:37:50,971 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/622321587/6b84c96c40c3430d9ab6b8bf2ac88680/FLAGf8bb1026e [2019-11-19 23:37:51,500 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:37:51,500 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:37:51,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/622321587/6b84c96c40c3430d9ab6b8bf2ac88680/FLAGf8bb1026e [2019-11-19 23:37:51,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/bin/uautomizer/data/622321587/6b84c96c40c3430d9ab6b8bf2ac88680 [2019-11-19 23:37:51,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:37:51,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:37:51,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:37:51,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:37:51,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:37:51,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:37:51" (1/1) ... [2019-11-19 23:37:51,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2574741d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:51, skipping insertion in model container [2019-11-19 23:37:51,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:37:51" (1/1) ... [2019-11-19 23:37:51,812 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:37:51,884 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:37:52,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:37:52,456 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:37:52,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:37:52,565 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:37:52,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52 WrapperNode [2019-11-19 23:37:52,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:37:52,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:37:52,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:37:52,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:37:52,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:37:52,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:37:52,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:37:52,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:37:52,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... [2019-11-19 23:37:52,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:37:52,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:37:52,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:37:52,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:37:52,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:37:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:37:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 23:37:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:37:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:37:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:37:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:37:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 23:37:53,103 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:37:57,265 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:37:57,265 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:37:57,266 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:37:57,267 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:37:57,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:37:57 BoogieIcfgContainer [2019-11-19 23:37:57,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:37:57,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:37:57,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:37:57,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:37:57,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:37:51" (1/3) ... [2019-11-19 23:37:57,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfed39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:37:57, skipping insertion in model container [2019-11-19 23:37:57,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:52" (2/3) ... [2019-11-19 23:37:57,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfed39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:37:57, skipping insertion in model container [2019-11-19 23:37:57,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:37:57" (3/3) ... [2019-11-19 23:37:57,275 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2019-11-19 23:37:57,284 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:37:57,294 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:37:57,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:37:57,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:37:57,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:37:57,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:37:57,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:37:57,330 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:37:57,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:37:57,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:37:57,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:37:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-19 23:37:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:37:57,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:57,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:57,367 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-19 23:37:57,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:37:57,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2022205630] [2019-11-19 23:37:57,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:57,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:37:57,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:57,755 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:37:57,782 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-19 23:37:57,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2022205630] [2019-11-19 23:37:57,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:57,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:37:57,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868777556] [2019-11-19 23:37:57,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:57,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:37:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:57,807 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-19 23:37:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:58,056 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-19 23:37:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:58,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 23:37:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:58,073 INFO L225 Difference]: With dead ends: 564 [2019-11-19 23:37:58,074 INFO L226 Difference]: Without dead ends: 385 [2019-11-19 23:37:58,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-19 23:37:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-19 23:37:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-19 23:37:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-19 23:37:58,145 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-19 23:37:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:58,146 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-19 23:37:58,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-19 23:37:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 23:37:58,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:58,150 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:58,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:37:58,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290477, now seen corresponding path program 1 times [2019-11-19 23:37:58,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:37:58,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [725333819] [2019-11-19 23:37:58,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:58,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:37:58,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:58,605 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-19 23:37:58,605 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:37:58,626 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-19 23:37:58,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725333819] [2019-11-19 23:37:58,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:58,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:37:58,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207267590] [2019-11-19 23:37:58,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:58,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:37:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:58,630 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-19 23:37:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:59,209 INFO L93 Difference]: Finished difference Result 880 states and 1354 transitions. [2019-11-19 23:37:59,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:59,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 23:37:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:59,214 INFO L225 Difference]: With dead ends: 880 [2019-11-19 23:37:59,214 INFO L226 Difference]: Without dead ends: 629 [2019-11-19 23:37:59,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-19 23:37:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-11-19 23:37:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-19 23:37:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-11-19 23:37:59,252 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 58 [2019-11-19 23:37:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:59,252 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-11-19 23:37:59,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-11-19 23:37:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-19 23:37:59,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:59,268 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:59,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:37:59,474 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash 647290871, now seen corresponding path program 1 times [2019-11-19 23:37:59,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:37:59,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [260315035] [2019-11-19 23:37:59,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:37:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:59,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:37:59,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:59,789 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-19 23:37:59,790 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:37:59,831 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-19 23:37:59,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [260315035] [2019-11-19 23:37:59,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:59,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:37:59,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198771774] [2019-11-19 23:37:59,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:59,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:37:59,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:59,845 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 4 states. [2019-11-19 23:38:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:00,607 INFO L93 Difference]: Finished difference Result 1368 states and 2093 transitions. [2019-11-19 23:38:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:00,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-19 23:38:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:00,613 INFO L225 Difference]: With dead ends: 1368 [2019-11-19 23:38:00,614 INFO L226 Difference]: Without dead ends: 873 [2019-11-19 23:38:00,615 INFO L630 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-19 23:38:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-11-19 23:38:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2019-11-19 23:38:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-11-19 23:38:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1324 transitions. [2019-11-19 23:38:00,657 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1324 transitions. Word has length 110 [2019-11-19 23:38:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:00,658 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1324 transitions. [2019-11-19 23:38:00,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1324 transitions. [2019-11-19 23:38:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-19 23:38:00,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:00,665 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:38:00,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:00,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1563243915, now seen corresponding path program 1 times [2019-11-19 23:38:00,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:00,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1059564942] [2019-11-19 23:38:00,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:01,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:01,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:01,132 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-19 23:38:01,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:01,163 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-19 23:38:01,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059564942] [2019-11-19 23:38:01,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:01,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:38:01,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054454464] [2019-11-19 23:38:01,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:38:01,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:38:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:38:01,166 INFO L87 Difference]: Start difference. First operand 873 states and 1324 transitions. Second operand 4 states. [2019-11-19 23:38:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:01,873 INFO L93 Difference]: Finished difference Result 1861 states and 2834 transitions. [2019-11-19 23:38:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:01,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-19 23:38:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:01,881 INFO L225 Difference]: With dead ends: 1861 [2019-11-19 23:38:01,881 INFO L226 Difference]: Without dead ends: 1120 [2019-11-19 23:38:01,890 INFO L630 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-19 23:38:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-11-19 23:38:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2019-11-19 23:38:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-11-19 23:38:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1694 transitions. [2019-11-19 23:38:01,944 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1694 transitions. Word has length 139 [2019-11-19 23:38:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:01,946 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 1694 transitions. [2019-11-19 23:38:01,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1694 transitions. [2019-11-19 23:38:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-19 23:38:01,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:01,949 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:38:02,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:02,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 959908544, now seen corresponding path program 1 times [2019-11-19 23:38:02,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:02,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [728979634] [2019-11-19 23:38:02,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:04,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:38:04,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:04,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:38:04,590 INFO L377 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-19 23:38:04,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:04,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:38:04,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:04,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:38:04,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:04,663 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-19 23:38:04,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:38:04,726 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-19 23:38:04,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:04,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:38:04,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:04,772 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:04,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:04,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:38:04,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-19 23:38:04,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [728979634] [2019-11-19 23:38:04,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:04,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:38:04,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651761917] [2019-11-19 23:38:04,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:38:04,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:38:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:04,824 INFO L87 Difference]: Start difference. First operand 1120 states and 1694 transitions. Second operand 4 states. [2019-11-19 23:38:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:09,112 INFO L93 Difference]: Finished difference Result 3276 states and 4978 transitions. [2019-11-19 23:38:09,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:09,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-19 23:38:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:09,129 INFO L225 Difference]: With dead ends: 3276 [2019-11-19 23:38:09,129 INFO L226 Difference]: Without dead ends: 2164 [2019-11-19 23:38:09,132 INFO L630 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-19 23:38:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-19 23:38:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1372. [2019-11-19 23:38:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-19 23:38:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2144 transitions. [2019-11-19 23:38:09,206 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2144 transitions. Word has length 163 [2019-11-19 23:38:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:09,207 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 2144 transitions. [2019-11-19 23:38:09,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2144 transitions. [2019-11-19 23:38:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-19 23:38:09,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:09,214 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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-19 23:38:09,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:09,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2081031755, now seen corresponding path program 1 times [2019-11-19 23:38:09,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:09,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [889412329] [2019-11-19 23:38:09,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:12,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:38:12,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:12,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:38:12,233 INFO L377 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-19 23:38:12,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:12,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:12,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:12,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:38:12,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:12,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:38:12,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:12,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:12,288 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-19 23:38:12,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:38:12,350 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-19 23:38:12,350 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:12,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:38:12,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:12,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:12,414 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:12,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:12,415 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-19 23:38:12,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:38:12,448 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-19 23:38:12,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889412329] [2019-11-19 23:38:12,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:12,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:38:12,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874173876] [2019-11-19 23:38:12,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:38:12,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:38:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:12,452 INFO L87 Difference]: Start difference. First operand 1372 states and 2144 transitions. Second operand 4 states. [2019-11-19 23:38:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:19,543 INFO L93 Difference]: Finished difference Result 3780 states and 5878 transitions. [2019-11-19 23:38:19,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:19,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-19 23:38:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:19,561 INFO L225 Difference]: With dead ends: 3780 [2019-11-19 23:38:19,561 INFO L226 Difference]: Without dead ends: 2416 [2019-11-19 23:38:19,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 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-19 23:38:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-11-19 23:38:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1633. [2019-11-19 23:38:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-11-19 23:38:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2612 transitions. [2019-11-19 23:38:19,667 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2612 transitions. Word has length 164 [2019-11-19 23:38:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:19,668 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 2612 transitions. [2019-11-19 23:38:19,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2612 transitions. [2019-11-19 23:38:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-19 23:38:19,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:19,674 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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-19 23:38:19,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:19,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -846659623, now seen corresponding path program 1 times [2019-11-19 23:38:19,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:19,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [914036125] [2019-11-19 23:38:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:23,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:38:23,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:23,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:38:23,157 INFO L377 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-19 23:38:23,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:23,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:23,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:23,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:38:23,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:23,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:38:23,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:23,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:23,222 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-19 23:38:23,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:38:23,327 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-19 23:38:23,366 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:23,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:38:23,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:23,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:23,415 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:23,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:23,416 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-19 23:38:23,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:38:23,461 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-19 23:38:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [914036125] [2019-11-19 23:38:23,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:23,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:38:23,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040308960] [2019-11-19 23:38:23,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:38:23,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:38:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:23,464 INFO L87 Difference]: Start difference. First operand 1633 states and 2612 transitions. Second operand 4 states. [2019-11-19 23:38:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:28,938 INFO L93 Difference]: Finished difference Result 4302 states and 6796 transitions. [2019-11-19 23:38:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:28,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-19 23:38:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:28,958 INFO L225 Difference]: With dead ends: 4302 [2019-11-19 23:38:28,958 INFO L226 Difference]: Without dead ends: 2677 [2019-11-19 23:38:28,963 INFO L630 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-19 23:38:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2019-11-19 23:38:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 1867. [2019-11-19 23:38:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-11-19 23:38:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 3017 transitions. [2019-11-19 23:38:29,066 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 3017 transitions. Word has length 191 [2019-11-19 23:38:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:29,066 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 3017 transitions. [2019-11-19 23:38:29,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 3017 transitions. [2019-11-19 23:38:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-19 23:38:29,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:29,073 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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-19 23:38:29,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:29,290 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -69051324, now seen corresponding path program 1 times [2019-11-19 23:38:29,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:29,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1131280772] [2019-11-19 23:38:29,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:32,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:38:32,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:32,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:38:32,527 INFO L377 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-19 23:38:32,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:32,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:32,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:32,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:38:32,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:32,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:38:32,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:32,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:32,578 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-19 23:38:32,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:38:32,652 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-19 23:38:32,653 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:32,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:38:32,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:32,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:32,695 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:32,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:32,697 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-19 23:38:32,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:38:32,750 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-19 23:38:32,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131280772] [2019-11-19 23:38:32,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:32,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:38:32,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228084332] [2019-11-19 23:38:32,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:38:32,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:38:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:32,757 INFO L87 Difference]: Start difference. First operand 1867 states and 3017 transitions. Second operand 4 states. [2019-11-19 23:38:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:38,168 INFO L93 Difference]: Finished difference Result 4509 states and 7147 transitions. [2019-11-19 23:38:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:38:38,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-19 23:38:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:38,195 INFO L225 Difference]: With dead ends: 4509 [2019-11-19 23:38:38,196 INFO L226 Difference]: Without dead ends: 2650 [2019-11-19 23:38:38,199 INFO L630 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-19 23:38:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-11-19 23:38:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 1867. [2019-11-19 23:38:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-11-19 23:38:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2999 transitions. [2019-11-19 23:38:38,340 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2999 transitions. Word has length 192 [2019-11-19 23:38:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:38,344 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 2999 transitions. [2019-11-19 23:38:38,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:38:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2999 transitions. [2019-11-19 23:38:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-19 23:38:38,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:38,359 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:38:38,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:38:38,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:38,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash -791919411, now seen corresponding path program 1 times [2019-11-19 23:38:38,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:38:38,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [503115698] [2019-11-19 23:38:38,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:38:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:44,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:38:44,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:44,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:38:44,176 INFO L377 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-19 23:38:44,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:44,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:44,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:44,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:38:44,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:44,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:38:44,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:44,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:44,213 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-19 23:38:44,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:38:44,284 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-19 23:38:44,284 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:38:44,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:38:44,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:38:44,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:44,328 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:38:44,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:38:44,329 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-19 23:38:44,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:38:44,361 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-19 23:38:44,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [503115698] [2019-11-19 23:38:44,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:44,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-19 23:38:44,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216105881] [2019-11-19 23:38:44,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:38:44,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:38:44,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:38:44,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:44,363 INFO L87 Difference]: Start difference. First operand 1867 states and 2999 transitions. Second operand 7 states. [2019-11-19 23:39:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:39:01,925 INFO L93 Difference]: Finished difference Result 5348 states and 8348 transitions. [2019-11-19 23:39:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:39:01,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-11-19 23:39:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:39:01,945 INFO L225 Difference]: With dead ends: 5348 [2019-11-19 23:39:01,945 INFO L226 Difference]: Without dead ends: 3489 [2019-11-19 23:39:01,949 INFO L630 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-19 23:39:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-11-19 23:39:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 2200. [2019-11-19 23:39:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-11-19 23:39:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3575 transitions. [2019-11-19 23:39:02,066 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3575 transitions. Word has length 192 [2019-11-19 23:39:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:39:02,066 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 3575 transitions. [2019-11-19 23:39:02,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:39:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3575 transitions. [2019-11-19 23:39:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-19 23:39:02,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:39:02,074 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:39:02,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:39:02,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:39:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:39:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1406420013, now seen corresponding path program 1 times [2019-11-19 23:39:02,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:39:02,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [806654991] [2019-11-19 23:39:02,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:39:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:39:08,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:39:08,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:39:08,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:39:08,023 INFO L377 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-19 23:39:08,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:08,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:08,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:08,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:39:08,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:08,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:39:08,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:08,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:08,066 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-19 23:39:08,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:39:08,169 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-19 23:39:08,169 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:39:08,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:39:08,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:08,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:08,198 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:08,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:08,200 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-19 23:39:08,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:39:08,233 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-19 23:39:08,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806654991] [2019-11-19 23:39:08,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:39:08,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-19 23:39:08,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033401380] [2019-11-19 23:39:08,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:39:08,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:39:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:39:08,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:39:08,235 INFO L87 Difference]: Start difference. First operand 2200 states and 3575 transitions. Second operand 7 states. [2019-11-19 23:39:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:39:23,752 INFO L93 Difference]: Finished difference Result 5720 states and 9015 transitions. [2019-11-19 23:39:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:39:23,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-11-19 23:39:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:39:23,772 INFO L225 Difference]: With dead ends: 5720 [2019-11-19 23:39:23,772 INFO L226 Difference]: Without dead ends: 3528 [2019-11-19 23:39:23,775 INFO L630 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-19 23:39:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-11-19 23:39:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2281. [2019-11-19 23:39:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-19 23:39:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3728 transitions. [2019-11-19 23:39:23,892 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3728 transitions. Word has length 193 [2019-11-19 23:39:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:39:23,893 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3728 transitions. [2019-11-19 23:39:23,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:39:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3728 transitions. [2019-11-19 23:39:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-19 23:39:23,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:39:23,899 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 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-19 23:39:24,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:39:24,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:39:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:39:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1735547418, now seen corresponding path program 2 times [2019-11-19 23:39:24,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:39:24,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [333778901] [2019-11-19 23:39:24,115 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:39:25,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:39:25,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:39:25,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:39:25,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:39:25,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 23:39:25,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:25,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:25,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:25,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-19 23:39:25,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:39:25,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:39:25,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:25,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:25,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:25,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 23:39:25,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:25,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:39:25,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:25,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:25,172 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-19 23:39:25,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:39:25,226 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-19 23:39:25,226 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:39:25,333 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-19 23:39:25,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [333778901] [2019-11-19 23:39:25,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:39:25,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-19 23:39:25,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871230771] [2019-11-19 23:39:25,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:39:25,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:39:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:39:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:39:25,335 INFO L87 Difference]: Start difference. First operand 2281 states and 3728 transitions. Second operand 8 states. [2019-11-19 23:39:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:39:37,315 INFO L93 Difference]: Finished difference Result 6389 states and 10134 transitions. [2019-11-19 23:39:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:39:37,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-11-19 23:39:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:39:37,342 INFO L225 Difference]: With dead ends: 6389 [2019-11-19 23:39:37,342 INFO L226 Difference]: Without dead ends: 4116 [2019-11-19 23:39:37,346 INFO L630 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-19 23:39:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2019-11-19 23:39:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 2481. [2019-11-19 23:39:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-19 23:39:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4044 transitions. [2019-11-19 23:39:37,467 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4044 transitions. Word has length 221 [2019-11-19 23:39:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:39:37,468 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 4044 transitions. [2019-11-19 23:39:37,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:39:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4044 transitions. [2019-11-19 23:39:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-19 23:39:37,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:39:37,476 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 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-19 23:39:37,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:39:37,686 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:39:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:39:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1263207772, now seen corresponding path program 1 times [2019-11-19 23:39:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:39:37,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [981630423] [2019-11-19 23:39:37,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:39:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:39:44,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:39:44,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:39:44,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:39:44,841 INFO L377 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-19 23:39:44,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:44,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:44,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:44,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:39:44,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:44,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:39:44,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:44,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:44,885 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-19 23:39:44,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:39:44,952 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-19 23:39:44,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:39:44,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-19 23:39:44,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:39:44,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:44,988 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:39:44,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:39:44,990 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-19 23:39:44,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:39:45,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-19 23:39:45,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [981630423] [2019-11-19 23:39:45,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:39:45,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-19 23:39:45,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179317862] [2019-11-19 23:39:45,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:39:45,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:39:45,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:39:45,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:39:45,036 INFO L87 Difference]: Start difference. First operand 2481 states and 4044 transitions. Second operand 7 states. [2019-11-19 23:40:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:40:03,505 INFO L93 Difference]: Finished difference Result 6489 states and 10286 transitions. [2019-11-19 23:40:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:40:03,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2019-11-19 23:40:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:40:03,519 INFO L225 Difference]: With dead ends: 6489 [2019-11-19 23:40:03,520 INFO L226 Difference]: Without dead ends: 4016 [2019-11-19 23:40:03,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 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-19 23:40:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2019-11-19 23:40:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2769. [2019-11-19 23:40:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2019-11-19 23:40:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 4512 transitions. [2019-11-19 23:40:03,650 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 4512 transitions. Word has length 221 [2019-11-19 23:40:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:40:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 2769 states and 4512 transitions. [2019-11-19 23:40:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:40:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 4512 transitions. [2019-11-19 23:40:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-19 23:40:03,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:40:03,657 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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-19 23:40:03,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:40:03,872 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:40:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:40:03,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1214559478, now seen corresponding path program 1 times [2019-11-19 23:40:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:40:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1423851037] [2019-11-19 23:40:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_974028fa-40f8-45c5-ac2d-1505259aef8d/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-19 23:40:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:40:07,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-19 23:40:07,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:40:08,542 INFO L237 Elim1Store]: Index analysis took 135 ms [2019-11-19 23:40:08,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:08,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-19 23:40:08,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:11,197 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-19 23:40:11,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:11,201 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-19 23:40:11,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:11,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:11,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:11,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:11,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:11,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:12,018 INFO L237 Elim1Store]: Index analysis took 684 ms [2019-11-19 23:40:12,682 INFO L377 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-19 23:40:12,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:14,683 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-19 23:40:14,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:14,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:14,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:14,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:14,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:14,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:14,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:15,169 INFO L237 Elim1Store]: Index analysis took 408 ms [2019-11-19 23:40:15,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-19 23:40:15,696 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:16,964 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-19 23:40:16,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:16,981 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-19 23:40:17,758 WARN L191 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-19 23:40:17,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:17,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:17,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-19 23:40:17,955 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,312 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:40:18,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-19 23:40:18,385 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,586 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-19 23:40:18,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-19 23:40:18,610 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,673 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-19 23:40:18,673 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-19 23:40:18,703 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_207|], 12=[|v_#memory_$Pointer$.base_207|]} [2019-11-19 23:40:18,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:40:18,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:40:18,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-19 23:40:18,828 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_208|], 12=[|v_#memory_$Pointer$.base_208|]} [2019-11-19 23:40:18,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:40:18,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:18,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:40:18,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:18,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:18,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-19 23:40:18,978 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-19 23:40:18,995 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-19 23:40:19,251 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-19 23:40:19,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-19 23:40:19,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,469 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 23:40:19,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,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-19 23:40:19,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-19 23:40:19,597 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,646 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-19 23:40:19,656 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_210|], 12=[|v_#memory_$Pointer$.base_210|]} [2019-11-19 23:40:19,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:40:19,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-19 23:40:19,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-19 23:40:19,770 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_211|], 12=[|v_#memory_$Pointer$.base_211|]} [2019-11-19 23:40:19,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:40:19,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-19 23:40:19,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-19 23:40:19,905 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_212|], 20=[|v_#memory_$Pointer$.base_212|]} [2019-11-19 23:40:19,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,918 INFO L377 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-19 23:40:19,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:19,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:19,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:19,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:20,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:20,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:20,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:20,318 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-19 23:40:20,318 INFO L343 Elim1Store]: treesize reduction 40, result has 81.2 percent of original size [2019-11-19 23:40:20,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 229 [2019-11-19 23:40:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:20,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:20,370 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-19 23:40:20,523 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-11-19 23:40:20,523 INFO L567 ElimStorePlain]: treesize reduction 162, result has 40.9 percent of original size [2019-11-19 23:40:20,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:20,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:127 [2019-11-19 23:40:20,598 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-19 23:40:20,619 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-19 23:40:20,952 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-19 23:40:20,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:20,964 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-19 23:40:21,176 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-19 23:40:21,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:21,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,245 INFO L377 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-19 23:40:21,246 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:21,479 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-19 23:40:21,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:21,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:21,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:27,923 WARN L191 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-19 23:40:27,923 INFO L343 Elim1Store]: treesize reduction 57, result has 75.0 percent of original size [2019-11-19 23:40:27,924 INFO L377 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-19 23:40:27,926 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,073 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-11-19 23:40:28,073 INFO L567 ElimStorePlain]: treesize reduction 225, result has 39.2 percent of original size [2019-11-19 23:40:28,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,074 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:203, output treesize:127 [2019-11-19 23:40:28,094 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_214|], 30=[|v_#memory_$Pointer$.base_214|]} [2019-11-19 23:40:28,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,140 INFO L377 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-19 23:40:28,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,300 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:40:28,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:28,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,607 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-19 23:40:28,608 INFO L343 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-19 23:40:28,608 INFO L377 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-19 23:40:28,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,730 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-19 23:40:28,731 INFO L567 ElimStorePlain]: treesize reduction 156, result has 44.9 percent of original size [2019-11-19 23:40:28,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,731 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:127 [2019-11-19 23:40:28,736 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_231|], 20=[|v_#memory_$Pointer$.offset_215|], 30=[|v_#memory_$Pointer$.base_215|]} [2019-11-19 23:40:28,765 INFO L377 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-19 23:40:28,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:28,892 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-19 23:40:28,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:28,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:28,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:28,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 197 [2019-11-19 23:40:28,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:29,106 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-19 23:40:29,106 INFO L567 ElimStorePlain]: treesize reduction 56, result has 77.9 percent of original size [2019-11-19 23:40:29,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,269 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-19 23:40:29,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:29,269 INFO L377 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-19 23:40:29,271 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:29,404 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-11-19 23:40:29,405 INFO L567 ElimStorePlain]: treesize reduction 244, result has 37.8 percent of original size [2019-11-19 23:40:29,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:29,405 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:256, output treesize:148 [2019-11-19 23:40:29,481 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_232|], 20=[|v_#memory_$Pointer$.offset_216|], 30=[|v_#memory_$Pointer$.base_216|]} [2019-11-19 23:40:29,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-19 23:40:29,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:29,676 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-19 23:40:29,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:29,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,695 INFO L377 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-19 23:40:29,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:29,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:29,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:29,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,070 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-19 23:40:32,070 INFO L343 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-19 23:40:32,071 INFO L377 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-19 23:40:32,072 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:32,232 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-11-19 23:40:32,232 INFO L567 ElimStorePlain]: treesize reduction 156, result has 50.2 percent of original size [2019-11-19 23:40:32,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:40:32,233 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:199, output treesize:157 [2019-11-19 23:40:32,358 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_233|], 12=[|v_#memory_$Pointer$.offset_217|], 20=[|v_#memory_$Pointer$.base_217|]} [2019-11-19 23:40:32,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-11-19 23:40:32,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:32,495 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:40:32,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:32,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,505 INFO L377 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-19 23:40:32,506 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-19 23:40:32,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:32,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:40:32,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:32,620 INFO L377 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-19 23:40:32,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,630 INFO L496 ElimStorePlain]: Start of recursive call 4: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 6 xjuncts. [2019-11-19 23:40:32,941 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-19 23:40:32,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:40:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:32,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-19 23:40:32,947 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:188, output treesize:221 [2019-11-19 23:40:33,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-19 23:40:33,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:33,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:33,149 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-19 23:40:33,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-11-19 23:40:33,707 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-19 23:40:33,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:40:33,809 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-19 23:40:33,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:33,830 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-19 23:40:33,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:33,843 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-19 23:40:33,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:44 [2019-11-19 23:40:33,903 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_221|, |v_#memory_$Pointer$.base_221|], 2=[|#memory_int|]} [2019-11-19 23:40:33,907 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-19 23:40:33,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:33,966 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-19 23:40:33,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:33,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 195 [2019-11-19 23:40:33,991 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:40:34,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:34,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,033 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-19 23:40:34,033 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:191 [2019-11-19 23:40:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,100 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-19 23:40:34,109 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-19 23:40:34,121 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-19 23:40:34,133 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-19 23:40:34,353 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-11-19 23:40:34,354 INFO L567 ElimStorePlain]: treesize reduction 381, result has 38.4 percent of original size [2019-11-19 23:40:34,360 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-19 23:40:34,367 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-19 23:40:34,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:34,446 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-19 23:40:34,446 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:529, output treesize:257 [2019-11-19 23:40:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:34,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:38,724 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-19 23:40:38,754 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-19 23:40:38,779 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-19 23:40:38,828 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-19 23:40:38,841 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-19 23:40:41,453 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-11-19 23:40:41,454 INFO L567 ElimStorePlain]: treesize reduction 42, result has 93.3 percent of original size [2019-11-19 23:40:41,470 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-19 23:40:41,499 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-19 23:40:41,536 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-19 23:40:41,554 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-19 23:40:42,937 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-19 23:40:42,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:42,963 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-19 23:40:42,988 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-19 23:40:43,009 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-19 23:40:43,037 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-19 23:40:43,891 WARN L191 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-19 23:40:43,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:43,912 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-19 23:40:43,928 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-19 23:40:43,947 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-19 23:40:43,960 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-19 23:40:44,270 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-11-19 23:40:44,270 INFO L567 ElimStorePlain]: treesize reduction 444, result has 43.5 percent of original size [2019-11-19 23:40:44,271 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-19 23:40:44,271 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:689, output treesize:342 [2019-11-19 23:40:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:40:44,938 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_225|], 41=[|v_#memory_$Pointer$.base_225|]} [2019-11-19 23:40:44,943 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-19 23:40:45,163 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-19 23:40:45,163 INFO L567 ElimStorePlain]: treesize reduction 352, result has 55.3 percent of original size [2019-11-19 23:40:45,165 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-19 23:40:45,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:40:45,203 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-19 23:40:45,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:637, output treesize:654 [2019-11-19 23:40:46,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:40:46,234 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-19 23:40:46,239 INFO L168 Benchmark]: Toolchain (without parser) took 174440.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 951.0 MB in the beginning and 992.8 MB in the end (delta: -41.8 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,240 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:40:46,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,241 INFO L168 Benchmark]: Boogie Preprocessor took 120.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,242 INFO L168 Benchmark]: RCFGBuilder took 4471.13 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,242 INFO L168 Benchmark]: TraceAbstraction took 168968.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:40:46,245 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 765.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4471.13 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168968.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 241.3 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...