./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 10:12:33,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:12:33,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:12:33,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:12:33,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:12:33,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:12:33,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:12:33,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:12:33,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:12:33,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:12:33,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:12:33,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:12:33,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:12:33,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:12:33,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:12:33,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:12:33,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:12:33,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:12:33,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:12:33,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:12:33,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:12:33,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:12:33,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:12:33,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:12:33,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:12:33,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:12:33,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:12:33,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:12:33,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:12:33,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:12:33,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:12:33,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:12:33,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:12:33,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:12:33,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:12:33,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:12:33,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:12:33,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:12:33,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:12:33,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:12:33,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:12:33,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 10:12:33,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:12:33,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:12:33,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:12:33,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:12:33,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:12:33,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:12:33,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:12:33,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:12:33,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:12:33,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:12:33,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:12:33,221 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:12:33,222 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:12:33,222 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 10:12:33,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:12:33,223 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:12:33,223 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:12:33,223 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:12:33,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:12:33,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:12:33,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:12:33,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:12:33,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:12:33,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:12:33,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:12:33,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:12:33,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:12:33,225 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:12:33,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:12:33,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:12:33,226 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-22 10:12:33,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:12:33,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:12:33,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:12:33,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:12:33,552 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:12:33,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 10:12:33,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3d9db1e/5034ed48bedc45b6a90ec8ea5ec5ade6/FLAG57c549f18 [2019-11-22 10:12:34,194 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:12:34,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 10:12:34,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3d9db1e/5034ed48bedc45b6a90ec8ea5ec5ade6/FLAG57c549f18 [2019-11-22 10:12:34,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3d9db1e/5034ed48bedc45b6a90ec8ea5ec5ade6 [2019-11-22 10:12:34,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:12:34,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:12:34,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:12:34,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:12:34,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:12:34,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:34" (1/1) ... [2019-11-22 10:12:34,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:34, skipping insertion in model container [2019-11-22 10:12:34,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:34" (1/1) ... [2019-11-22 10:12:34,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:12:34,564 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:12:35,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:12:35,087 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:12:35,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:12:35,272 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:12:35,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35 WrapperNode [2019-11-22 10:12:35,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:12:35,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:12:35,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:12:35,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:12:35,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... [2019-11-22 10:12:35,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:12:35,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:12:35,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:12:35,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:12:35,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:12:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:12:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:12:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 10:12:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:12:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:12:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:12:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 10:12:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 10:12:35,422 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 10:12:35,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:12:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:12:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:12:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:12:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:12:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:12:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:12:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:12:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:12:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:12:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:12:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:12:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:12:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:12:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:12:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:12:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:12:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:12:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:12:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:12:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:12:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:12:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:12:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:12:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:12:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:12:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:12:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:12:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:12:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:12:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:12:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:12:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:12:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:12:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:12:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:12:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:12:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:12:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:12:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:12:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:12:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:12:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:12:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:12:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:12:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:12:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:12:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:12:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:12:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:12:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:12:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:12:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:12:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:12:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:12:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:12:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:12:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 10:12:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:12:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:12:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:12:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:12:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:12:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:12:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:12:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:12:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:12:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:12:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:12:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:12:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:12:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:12:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:12:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:12:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:12:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:12:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:12:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:12:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:12:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:12:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:12:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:12:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:12:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:12:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:12:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:12:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:12:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:12:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:12:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:12:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:12:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:12:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:12:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:12:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:12:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:12:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:12:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:12:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:12:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:12:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:12:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:12:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:12:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:12:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:12:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:12:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 10:12:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 10:12:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 10:12:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 10:12:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 10:12:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 10:12:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 10:12:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 10:12:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 10:12:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 10:12:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 10:12:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 10:12:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 10:12:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 10:12:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 10:12:35,463 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 10:12:35,463 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 10:12:35,463 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 10:12:35,463 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 10:12:35,463 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 10:12:35,464 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 10:12:35,464 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 10:12:35,464 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 10:12:35,464 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 10:12:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 10:12:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 10:12:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 10:12:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 10:12:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 10:12:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 10:12:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 10:12:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 10:12:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 10:12:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 10:12:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 10:12:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 10:12:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 10:12:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 10:12:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 10:12:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 10:12:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 10:12:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 10:12:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:12:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 10:12:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:12:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:12:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:12:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 10:12:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:12:36,283 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:12:36,283 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 10:12:36,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:36 BoogieIcfgContainer [2019-11-22 10:12:36,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:12:36,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:12:36,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:12:36,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:12:36,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:12:34" (1/3) ... [2019-11-22 10:12:36,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de4759c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:36, skipping insertion in model container [2019-11-22 10:12:36,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:35" (2/3) ... [2019-11-22 10:12:36,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de4759c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:36, skipping insertion in model container [2019-11-22 10:12:36,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:36" (3/3) ... [2019-11-22 10:12:36,294 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 10:12:36,304 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:12:36,310 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 10:12:36,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 10:12:36,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:12:36,337 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:12:36,337 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:12:36,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:12:36,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:12:36,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:12:36,338 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:12:36,338 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:12:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 10:12:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:12:36,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:36,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:36,369 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 10:12:36,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:36,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2039156286] [2019-11-22 10:12:36,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:12:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:36,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:12:36,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:37,343 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:12:37,346 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:12:37,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 10:12:37,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:37,458 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-22 10:12:37,460 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 10:12:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:37,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:37,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 10:12:37,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:37,535 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-22 10:12:37,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:37,573 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-22 10:12:37,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039156286] [2019-11-22 10:12:37,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:37,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:12:37,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369636871] [2019-11-22 10:12:37,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:12:37,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:12:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:12:37,602 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 10:12:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:37,773 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-22 10:12:37,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:12:37,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 10:12:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:37,788 INFO L225 Difference]: With dead ends: 93 [2019-11-22 10:12:37,788 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 10:12:37,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:12:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 10:12:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-22 10:12:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 10:12:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-22 10:12:37,846 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-22 10:12:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:37,847 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-22 10:12:37,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:12:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-22 10:12:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:12:37,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:37,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:38,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:38,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 10:12:38,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:38,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024230105] [2019-11-22 10:12:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:12:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:38,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:12:38,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:38,840 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:12:38,841 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:12:38,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:12:38,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:38,983 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 10:12:38,985 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 10:12:38,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:12:38,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 10:12:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:12:39,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:39,256 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-22 10:12:39,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024230105] [2019-11-22 10:12:39,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:39,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:12:39,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242155301] [2019-11-22 10:12:39,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:12:39,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:12:39,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:12:39,259 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-22 10:12:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:39,968 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-22 10:12:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:12:39,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 10:12:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:39,977 INFO L225 Difference]: With dead ends: 172 [2019-11-22 10:12:39,979 INFO L226 Difference]: Without dead ends: 172 [2019-11-22 10:12:39,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:12:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-22 10:12:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-22 10:12:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-22 10:12:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-22 10:12:40,027 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-22 10:12:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:40,027 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-22 10:12:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:12:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-22 10:12:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:12:40,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:40,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:40,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:40,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 10:12:40,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:40,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2038210238] [2019-11-22 10:12:40,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:12:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:40,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 10:12:40,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:41,258 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 10:12:41,259 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 10:12:41,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 289 treesize of output 391 [2019-11-22 10:12:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:41,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:42,382 WARN L192 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 66 [2019-11-22 10:12:42,386 INFO L567 ElimStorePlain]: treesize reduction 5712, result has 2.8 percent of original size [2019-11-22 10:12:42,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:42,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 10:12:42,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:12:42,986 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-11-22 10:12:43,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 46 [2019-11-22 10:12:43,035 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-22 10:12:43,190 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-11-22 10:12:43,191 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.2 percent of original size [2019-11-22 10:12:43,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:43,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:135, output treesize:81 [2019-11-22 10:12:43,236 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-22 10:12:43,237 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:43,630 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-22 10:12:43,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2038210238] [2019-11-22 10:12:43,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:43,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:12:43,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394980332] [2019-11-22 10:12:43,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:12:43,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:12:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:12:43,633 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 8 states. [2019-11-22 10:12:44,770 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-11-22 10:12:45,055 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 10:12:46,964 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-11-22 10:12:48,703 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-11-22 10:12:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:49,402 INFO L93 Difference]: Finished difference Result 292 states and 423 transitions. [2019-11-22 10:12:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:12:49,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 10:12:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:49,409 INFO L225 Difference]: With dead ends: 292 [2019-11-22 10:12:49,409 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 10:12:49,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 10:12:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 10:12:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2019-11-22 10:12:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-22 10:12:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2019-11-22 10:12:49,440 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 10 [2019-11-22 10:12:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:49,440 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2019-11-22 10:12:49,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:12:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2019-11-22 10:12:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 10:12:49,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:49,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:49,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:49,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 10:12:49,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:49,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2136407279] [2019-11-22 10:12:49,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:12:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:50,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:12:50,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:50,148 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 10:12:50,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:50,643 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 10:12:50,643 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 10:12:50,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 10:12:50,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:50,941 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 10:12:50,941 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 10:12:51,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:51,034 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 420 treesize of output 428 [2019-11-22 10:12:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,632 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 69 [2019-11-22 10:12:51,632 INFO L567 ElimStorePlain]: treesize reduction 6254, result has 2.4 percent of original size [2019-11-22 10:12:51,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:12:51,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 10:12:51,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:51,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:12:51,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2019-11-22 10:12:51,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:12:51,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:51,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 10:12:51,909 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,945 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:51,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 126 [2019-11-22 10:12:51,947 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,957 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:51,957 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,968 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:51,968 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:51,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:12:51,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2019-11-22 10:12:52,000 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,011 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:52,012 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,023 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:52,023 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2019-11-22 10:12:52,049 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,058 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:52,058 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,067 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:12:52,067 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:52,545 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:12:52,546 INFO L567 ElimStorePlain]: treesize reduction 337, result has 47.9 percent of original size [2019-11-22 10:12:52,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 10:12:52,549 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1515, output treesize:310 [2019-11-22 10:12:52,863 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 10:12:53,210 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-22 10:12:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:12:53,247 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 79 treesize of output 59 [2019-11-22 10:12:53,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:53,479 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-22 10:12:53,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:53,509 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 51 treesize of output 43 [2019-11-22 10:12:53,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:53,712 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 10:12:53,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:53,725 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 79 treesize of output 59 [2019-11-22 10:12:53,726 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-22 10:12:53,876 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 10:12:53,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:53,892 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 84 treesize of output 76 [2019-11-22 10:12:53,893 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:54,050 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 10:12:54,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:54,068 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 56 treesize of output 48 [2019-11-22 10:12:54,069 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:12:54,218 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 10:12:54,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:54,227 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 73 treesize of output 45 [2019-11-22 10:12:54,229 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-22 10:12:54,344 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-22 10:12:54,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:12:54,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 10:12:54,347 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:243, output treesize:121 [2019-11-22 10:12:54,535 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-11-22 10:12:54,542 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-22 10:12:54,543 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:12:54,813 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 10:12:55,065 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-22 10:12:55,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136407279] [2019-11-22 10:12:55,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:12:55,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 10:12:55,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224311242] [2019-11-22 10:12:55,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 10:12:55,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:12:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 10:12:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:12:55,067 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand 9 states. [2019-11-22 10:12:55,512 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2019-11-22 10:12:56,079 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2019-11-22 10:12:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:12:57,701 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2019-11-22 10:12:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 10:12:57,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 10:12:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:12:57,707 INFO L225 Difference]: With dead ends: 412 [2019-11-22 10:12:57,707 INFO L226 Difference]: Without dead ends: 412 [2019-11-22 10:12:57,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 10:12:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-22 10:12:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 343. [2019-11-22 10:12:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 10:12:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 545 transitions. [2019-11-22 10:12:57,747 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 545 transitions. Word has length 11 [2019-11-22 10:12:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:12:57,747 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 545 transitions. [2019-11-22 10:12:57,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 10:12:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 545 transitions. [2019-11-22 10:12:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 10:12:57,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:12:57,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:12:57,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:12:57,954 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:12:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:12:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 10:12:57,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:12:57,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1940114946] [2019-11-22 10:12:57,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:12:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:12:58,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:12:58,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:12:58,719 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 10:12:58,720 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 10:12:58,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 10:12:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:58,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:12:59,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:01,378 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 467 DAG size of output: 63 [2019-11-22 10:13:01,379 INFO L567 ElimStorePlain]: treesize reduction 57892, result has 0.2 percent of original size [2019-11-22 10:13:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:01,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 10:13:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:01,968 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 10:13:02,104 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-22 10:13:02,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:02,386 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-22 10:13:02,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940114946] [2019-11-22 10:13:02,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:02,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:13:02,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152299628] [2019-11-22 10:13:02,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:13:02,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:13:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:13:02,388 INFO L87 Difference]: Start difference. First operand 343 states and 545 transitions. Second operand 10 states. [2019-11-22 10:13:03,497 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 10:13:04,213 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 10:13:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:05,384 INFO L93 Difference]: Finished difference Result 433 states and 653 transitions. [2019-11-22 10:13:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 10:13:05,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 10:13:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:05,392 INFO L225 Difference]: With dead ends: 433 [2019-11-22 10:13:05,392 INFO L226 Difference]: Without dead ends: 433 [2019-11-22 10:13:05,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:13:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-22 10:13:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-11-22 10:13:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-22 10:13:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 599 transitions. [2019-11-22 10:13:05,436 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 599 transitions. Word has length 12 [2019-11-22 10:13:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:05,436 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 599 transitions. [2019-11-22 10:13:05,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:13:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 599 transitions. [2019-11-22 10:13:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 10:13:05,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:05,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:05,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:05,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 10:13:05,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:05,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [291279613] [2019-11-22 10:13:05,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:06,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 10:13:06,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:06,179 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 10:13:06,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,253 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 10:13:06,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 10:13:06,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:06,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:06,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:06,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:06,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 10:13:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:06,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:06,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:06,553 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-22 10:13:06,554 INFO L567 ElimStorePlain]: treesize reduction 273, result has 18.5 percent of original size [2019-11-22 10:13:06,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:06,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 10:13:06,808 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-22 10:13:06,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:07,109 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-22 10:13:07,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [291279613] [2019-11-22 10:13:07,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:07,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:13:07,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065052663] [2019-11-22 10:13:07,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:13:07,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:13:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:07,111 INFO L87 Difference]: Start difference. First operand 381 states and 599 transitions. Second operand 8 states. [2019-11-22 10:13:07,983 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-22 10:13:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:09,345 INFO L93 Difference]: Finished difference Result 441 states and 624 transitions. [2019-11-22 10:13:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:13:09,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 10:13:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:09,349 INFO L225 Difference]: With dead ends: 441 [2019-11-22 10:13:09,349 INFO L226 Difference]: Without dead ends: 441 [2019-11-22 10:13:09,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 10:13:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-22 10:13:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2019-11-22 10:13:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-22 10:13:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2019-11-22 10:13:09,370 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 13 [2019-11-22 10:13:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:09,370 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2019-11-22 10:13:09,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:13:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2019-11-22 10:13:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:13:09,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:09,372 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:09,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:09,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 10:13:09,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:09,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [611517676] [2019-11-22 10:13:09,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:10,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 10:13:10,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:10,158 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 9=[|v_#valid_93|]} [2019-11-22 10:13:10,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:10,492 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 10:13:10,494 INFO L343 Elim1Store]: treesize reduction 63, result has 65.6 percent of original size [2019-11-22 10:13:10,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 10:13:10,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:10,722 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 10:13:10,722 INFO L567 ElimStorePlain]: treesize reduction 62, result has 70.9 percent of original size [2019-11-22 10:13:10,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:10,778 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 204 treesize of output 206 [2019-11-22 10:13:10,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:10,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:10,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:10,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,241 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-11-22 10:13:11,242 INFO L567 ElimStorePlain]: treesize reduction 585, result has 19.4 percent of original size [2019-11-22 10:13:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:11,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:141 [2019-11-22 10:13:11,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:11,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:11,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:11,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 110 [2019-11-22 10:13:11,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-22 10:13:11,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,535 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:11,535 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,550 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:11,550 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,569 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:11,569 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:11,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-22 10:13:11,603 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:11,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2019-11-22 10:13:11,626 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:11,634 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:11,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:11,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2019-11-22 10:13:11,656 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:11,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 10:13:11,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2019-11-22 10:13:11,674 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:11,687 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:11,688 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:12,096 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-22 10:13:12,097 INFO L567 ElimStorePlain]: treesize reduction 249, result has 50.8 percent of original size [2019-11-22 10:13:12,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-11-22 10:13:12,099 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:1252, output treesize:257 [2019-11-22 10:13:14,413 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-11-22 10:13:14,723 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-22 10:13:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:14,745 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 63 treesize of output 55 [2019-11-22 10:13:14,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:14,854 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-22 10:13:14,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:14,867 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 62 treesize of output 50 [2019-11-22 10:13:14,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:14,978 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-22 10:13:14,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:14,989 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 41 [2019-11-22 10:13:14,989 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:15,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:15,080 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 52 treesize of output 44 [2019-11-22 10:13:15,081 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:15,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:15,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-22 10:13:15,165 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:126, output treesize:75 [2019-11-22 10:13:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:15,297 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:15,676 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-22 10:13:15,779 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-22 10:13:15,910 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-22 10:13:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:16,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [611517676] [2019-11-22 10:13:16,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:13:16,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-22 10:13:16,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020709171] [2019-11-22 10:13:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 10:13:16,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:16,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 10:13:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:13:16,022 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand 11 states. [2019-11-22 10:13:16,356 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-22 10:13:16,723 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-22 10:13:17,037 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 10:13:17,466 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-11-22 10:13:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:19,653 INFO L93 Difference]: Finished difference Result 520 states and 767 transitions. [2019-11-22 10:13:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 10:13:19,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 10:13:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:19,659 INFO L225 Difference]: With dead ends: 520 [2019-11-22 10:13:19,660 INFO L226 Difference]: Without dead ends: 520 [2019-11-22 10:13:19,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-22 10:13:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-22 10:13:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 421. [2019-11-22 10:13:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-22 10:13:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 658 transitions. [2019-11-22 10:13:19,682 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 658 transitions. Word has length 19 [2019-11-22 10:13:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:19,682 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 658 transitions. [2019-11-22 10:13:19,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 10:13:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 658 transitions. [2019-11-22 10:13:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 10:13:19,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:19,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:19,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:19,894 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-22 10:13:19,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:19,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [493272806] [2019-11-22 10:13:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:20,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:13:20,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:20,151 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-22 10:13:20,151 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:20,159 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-22 10:13:20,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493272806] [2019-11-22 10:13:20,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:20,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:13:20,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407896328] [2019-11-22 10:13:20,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:13:20,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:13:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:13:20,161 INFO L87 Difference]: Start difference. First operand 421 states and 658 transitions. Second operand 3 states. [2019-11-22 10:13:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:20,169 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-11-22 10:13:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:20,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 10:13:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:20,172 INFO L225 Difference]: With dead ends: 322 [2019-11-22 10:13:20,172 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 10:13:20,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-22 10:13:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 10:13:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2019-11-22 10:13:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 10:13:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 464 transitions. [2019-11-22 10:13:20,187 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 464 transitions. Word has length 23 [2019-11-22 10:13:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:20,188 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 464 transitions. [2019-11-22 10:13:20,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:13:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 464 transitions. [2019-11-22 10:13:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 10:13:20,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:20,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:20,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:20,399 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-22 10:13:20,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:20,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [71426424] [2019-11-22 10:13:20,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:20,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 10:13:20,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:20,664 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-22 10:13:20,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:20,676 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-22 10:13:20,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71426424] [2019-11-22 10:13:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:13:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253816016] [2019-11-22 10:13:20,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:13:20,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:13:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:13:20,679 INFO L87 Difference]: Start difference. First operand 317 states and 464 transitions. Second operand 3 states. [2019-11-22 10:13:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:20,737 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2019-11-22 10:13:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:20,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-22 10:13:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:20,741 INFO L225 Difference]: With dead ends: 421 [2019-11-22 10:13:20,741 INFO L226 Difference]: Without dead ends: 421 [2019-11-22 10:13:20,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-22 10:13:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-22 10:13:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2019-11-22 10:13:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-22 10:13:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 619 transitions. [2019-11-22 10:13:20,758 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 619 transitions. Word has length 24 [2019-11-22 10:13:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:20,761 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 619 transitions. [2019-11-22 10:13:20,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:13:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 619 transitions. [2019-11-22 10:13:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 10:13:20,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:20,765 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] [2019-11-22 10:13:20,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:20,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 249216982, now seen corresponding path program 1 times [2019-11-22 10:13:20,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:20,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1724600238] [2019-11-22 10:13:20,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:21,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 10:13:21,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:21,239 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-22 10:13:21,239 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:21,249 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-22 10:13:21,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724600238] [2019-11-22 10:13:21,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:21,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:13:21,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765524303] [2019-11-22 10:13:21,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:13:21,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:13:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:13:21,251 INFO L87 Difference]: Start difference. First operand 411 states and 619 transitions. Second operand 4 states. [2019-11-22 10:13:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:21,302 INFO L93 Difference]: Finished difference Result 358 states and 502 transitions. [2019-11-22 10:13:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:13:21,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 10:13:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:21,305 INFO L225 Difference]: With dead ends: 358 [2019-11-22 10:13:21,306 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 10:13:21,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-22 10:13:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 10:13:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-11-22 10:13:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-22 10:13:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2019-11-22 10:13:21,318 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 25 [2019-11-22 10:13:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:21,318 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2019-11-22 10:13:21,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:13:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2019-11-22 10:13:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 10:13:21,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:21,319 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:21,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:21,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 10:13:21,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:21,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1240224055] [2019-11-22 10:13:21,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:21,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:13:21,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:21,928 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:21,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1240224055] [2019-11-22 10:13:21,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:13:21,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 10:13:21,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286126933] [2019-11-22 10:13:21,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:13:21,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:13:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:21,972 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand 8 states. [2019-11-22 10:13:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:22,100 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-22 10:13:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:13:22,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 10:13:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:22,102 INFO L225 Difference]: With dead ends: 365 [2019-11-22 10:13:22,103 INFO L226 Difference]: Without dead ends: 365 [2019-11-22 10:13:22,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-22 10:13:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-22 10:13:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-22 10:13:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-22 10:13:22,116 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-22 10:13:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:22,117 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-22 10:13:22,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:13:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-22 10:13:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:13:22,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:22,118 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] [2019-11-22 10:13:22,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:22,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-22 10:13:22,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:22,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1010815922] [2019-11-22 10:13:22,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:22,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 10:13:22,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:22,691 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-22 10:13:22,692 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:22,733 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-22 10:13:22,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1010815922] [2019-11-22 10:13:22,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:22,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:13:22,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136391605] [2019-11-22 10:13:22,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:13:22,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:13:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:13:22,735 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-22 10:13:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:22,743 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-22 10:13:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:22,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 10:13:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:22,745 INFO L225 Difference]: With dead ends: 229 [2019-11-22 10:13:22,745 INFO L226 Difference]: Without dead ends: 229 [2019-11-22 10:13:22,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-22 10:13:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-22 10:13:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-22 10:13:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-22 10:13:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-22 10:13:22,753 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-22 10:13:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:22,754 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-22 10:13:22,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:13:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-22 10:13:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 10:13:22,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:22,760 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:22,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:22,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 10:13:22,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:22,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1129066454] [2019-11-22 10:13:22,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:13:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:23,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:13:23,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:23,823 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 10:13:23,824 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 10:13:23,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 10:13:23,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:23,972 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 10:13:23,972 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 10:13:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:23,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:23,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 10:13:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:24,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:24,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:24,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:24,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:13:24,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:24,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:13:24,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,812 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 10:13:24,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:24,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 10:13:24,817 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,823 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:24,823 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,834 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:24,834 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,840 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 10:13:24,840 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:24,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:24,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 10:13:24,965 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:25,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:25,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:13:25,033 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 10:13:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 10:13:25,333 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 10:13:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:13:25,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 10:13:25,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1129066454] [2019-11-22 10:13:25,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:13:25,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 10:13:25,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853282973] [2019-11-22 10:13:25,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 10:13:25,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:25,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 10:13:25,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 10:13:25,767 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 14 states. [2019-11-22 10:13:29,212 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 10:13:34,150 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 10:13:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:36,502 INFO L93 Difference]: Finished difference Result 325 states and 387 transitions. [2019-11-22 10:13:36,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 10:13:36,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 10:13:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:36,506 INFO L225 Difference]: With dead ends: 325 [2019-11-22 10:13:36,506 INFO L226 Difference]: Without dead ends: 319 [2019-11-22 10:13:36,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 10:13:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-22 10:13:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 282. [2019-11-22 10:13:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-22 10:13:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-22 10:13:36,515 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-22 10:13:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:36,516 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-22 10:13:36,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 10:13:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-22 10:13:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 10:13:36,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:36,519 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] [2019-11-22 10:13:36,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:36,732 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:13:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-22 10:13:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:36,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1317702009] [2019-11-22 10:13:36,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:37,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 10:13:37,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:37,712 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 10:13:37,713 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 10:13:37,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 10:13:37,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:37,843 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 10:13:37,844 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 10:13:37,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:37,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 10:13:37,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 10:13:37,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:37,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:37,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:37,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 10:13:37,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:37,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 10:13:37,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:37,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:37,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:37,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 10:13:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:13:38,021 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:38,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:38,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 10:13:39,216 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 10:13:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:13:39,221 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2019-11-22 10:13:39,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:39,437 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) 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.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-22 10:13:39,444 INFO L168 Benchmark]: Toolchain (without parser) took 64936.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 269.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:13:39,444 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:13:39,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:13:39,445 INFO L168 Benchmark]: Boogie Preprocessor took 80.46 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-22 10:13:39,445 INFO L168 Benchmark]: RCFGBuilder took 931.72 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:13:39,446 INFO L168 Benchmark]: TraceAbstraction took 63155.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.7 MB). Peak memory consumption was 222.3 MB. Max. memory is 11.5 GB. [2019-11-22 10:13:39,447 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 762.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.46 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 931.72 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63155.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.7 MB). Peak memory consumption was 222.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...