./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 0b33005346e6b80bc2289c235b2b7a5c7f83b2de ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:42:44,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:42:44,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:42:44,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:42:44,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:42:44,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:42:44,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:42:44,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:42:44,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:42:44,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:42:44,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:42:44,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:42:44,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:42:44,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:42:44,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:42:44,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:42:44,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:42:44,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:42:44,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:42:44,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:42:44,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:42:44,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:42:44,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:42:44,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:42:44,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:42:44,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:42:44,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:42:44,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:42:44,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:42:44,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:42:44,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:42:44,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:42:44,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:42:44,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:42:44,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:42:44,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:42:44,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:42:44,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:42:44,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:42:44,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:42:44,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:42:44,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 09:42:44,328 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:42:44,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:42:44,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:42:44,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:42:44,335 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:42:44,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:42:44,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:42:44,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:42:44,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:42:44,337 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:42:44,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:42:44,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 09:42:44,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:42:44,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:42:44,339 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:42:44,340 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:42:44,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:42:44,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:42:44,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:42:44,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:42:44,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:42:44,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:42:44,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:42:44,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:42:44,343 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:42:44,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:42:44,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:42:44,344 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b33005346e6b80bc2289c235b2b7a5c7f83b2de [2019-11-22 09:42:44,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:42:44,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:42:44,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:42:44,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:42:44,669 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:42:44,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2019-11-22 09:42:44,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d197692fa/e125c230565d464fbafd21c2a45e3c2e/FLAGc1e545642 [2019-11-22 09:42:45,316 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:42:45,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2019-11-22 09:42:45,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d197692fa/e125c230565d464fbafd21c2a45e3c2e/FLAGc1e545642 [2019-11-22 09:42:45,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d197692fa/e125c230565d464fbafd21c2a45e3c2e [2019-11-22 09:42:45,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:42:45,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:42:45,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:42:45,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:42:45,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:42:45,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:42:45" (1/1) ... [2019-11-22 09:42:45,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b7a959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:45, skipping insertion in model container [2019-11-22 09:42:45,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:42:45" (1/1) ... [2019-11-22 09:42:45,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:42:45,668 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:42:46,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:42:46,164 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:42:46,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:42:46,307 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:42:46,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46 WrapperNode [2019-11-22 09:42:46,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:42:46,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:42:46,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:42:46,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:42:46,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (1/1) ... [2019-11-22 09:42:46,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:42:46,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:42:46,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:42:46,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:42:46,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (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 09:42:46,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:42:46,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:42:46,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 09:42:46,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:42:46,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:42:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:42:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 09:42:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 09:42:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 09:42:46,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:42:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:42:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:42:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:42:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:42:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:42:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:42:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:42:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:42:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:42:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:42:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:42:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:42:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:42:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:42:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:42:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:42:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:42:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:42:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:42:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:42:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:42:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:42:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:42:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:42:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:42:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:42:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:42:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:42:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:42:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:42:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:42:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:42:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:42:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:42:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:42:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:42:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:42:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:42:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:42:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:42:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:42:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:42:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:42:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:42:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:42:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:42:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:42:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:42:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:42:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:42:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:42:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:42:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:42:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:42:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:42:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:42:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 09:42:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:42:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:42:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:42:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:42:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:42:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:42:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:42:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:42:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:42:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:42:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:42:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:42:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:42:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:42:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:42:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:42:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:42:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:42:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:42:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:42:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:42:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:42:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:42:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:42:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:42:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:42:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:42:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:42:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:42:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:42:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:42:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:42:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:42:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:42:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:42:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:42:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:42:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:42:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:42:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:42:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:42:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:42:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:42:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 09:42:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 09:42:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 09:42:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 09:42:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 09:42:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 09:42:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 09:42:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 09:42:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 09:42:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 09:42:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 09:42:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 09:42:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 09:42:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 09:42:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 09:42:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 09:42:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 09:42:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 09:42:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 09:42:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 09:42:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 09:42:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 09:42:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 09:42:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 09:42:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 09:42:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 09:42:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 09:42:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 09:42:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 09:42:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 09:42:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 09:42:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 09:42:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 09:42:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 09:42:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 09:42:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 09:42:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 09:42:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 09:42:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 09:42:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 09:42:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 09:42:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 09:42:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 09:42:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 09:42:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:42:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:42:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:42:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:42:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 09:42:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 09:42:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:42:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:42:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 09:42:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:42:47,276 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:42:47,276 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 09:42:47,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:42:47 BoogieIcfgContainer [2019-11-22 09:42:47,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:42:47,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:42:47,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:42:47,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:42:47,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:42:45" (1/3) ... [2019-11-22 09:42:47,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0b0270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:42:47, skipping insertion in model container [2019-11-22 09:42:47,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:42:46" (2/3) ... [2019-11-22 09:42:47,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0b0270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:42:47, skipping insertion in model container [2019-11-22 09:42:47,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:42:47" (3/3) ... [2019-11-22 09:42:47,287 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2019-11-22 09:42:47,298 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:42:47,305 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-22 09:42:47,315 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-22 09:42:47,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:42:47,333 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:42:47,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:42:47,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:42:47,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:42:47,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:42:47,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:42:47,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:42:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-22 09:42:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:42:47,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:42:47,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:42:47,365 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:42:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:42:47,374 INFO L82 PathProgramCache]: Analyzing trace with hash -317410196, now seen corresponding path program 1 times [2019-11-22 09:42:47,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:42:47,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1560979828] [2019-11-22 09:42:47,390 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 09:42:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:42:47,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:42:47,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:42:48,309 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:42:48,312 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:42:48,313 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 09:42:48,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:48,431 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-22 09:42:48,432 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 09:42:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:48,457 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 09:42:48,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 09:42:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:48,499 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 09:42:48,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:42:48,531 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 09:42:48,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1560979828] [2019-11-22 09:42:48,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:42:48,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:42:48,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893555845] [2019-11-22 09:42:48,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:42:48,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:42:48,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:42:48,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:42:48,558 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2019-11-22 09:42:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:42:48,735 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-11-22 09:42:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:42:48,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 09:42:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:42:48,749 INFO L225 Difference]: With dead ends: 97 [2019-11-22 09:42:48,750 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 09:42:48,752 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 09:42:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 09:42:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-11-22 09:42:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-22 09:42:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2019-11-22 09:42:48,804 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 9 [2019-11-22 09:42:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:42:48,804 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2019-11-22 09:42:48,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:42:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2019-11-22 09:42:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:42:48,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:42:48,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:42:49,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:42:49,011 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:42:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:42:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -317410195, now seen corresponding path program 1 times [2019-11-22 09:42:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:42:49,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1258889705] [2019-11-22 09:42:49,013 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 09:42:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:42:49,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:42:49,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:42:49,813 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:42:49,814 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:42:49,815 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 09:42:49,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:49,973 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 09:42:49,976 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 09:42:49,982 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 09:42:49,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 09:42:50,019 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 09:42:50,019 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:42:50,159 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-11-22 09:42:50,279 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 09:42:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1258889705] [2019-11-22 09:42:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:42:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:42:50,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736131842] [2019-11-22 09:42:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:42:50,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:42:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:42:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:42:50,283 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 6 states. [2019-11-22 09:42:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:42:50,958 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2019-11-22 09:42:50,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:42:50,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 09:42:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:42:50,963 INFO L225 Difference]: With dead ends: 174 [2019-11-22 09:42:50,963 INFO L226 Difference]: Without dead ends: 174 [2019-11-22 09:42:50,964 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 09:42:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-22 09:42:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2019-11-22 09:42:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-22 09:42:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2019-11-22 09:42:50,990 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 9 [2019-11-22 09:42:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:42:50,990 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2019-11-22 09:42:50,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:42:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2019-11-22 09:42:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:42:50,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:42:50,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:42:51,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:42:51,199 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:42:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:42:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1249781436, now seen corresponding path program 1 times [2019-11-22 09:42:51,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:42:51,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1486861487] [2019-11-22 09:42:51,202 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 09:42:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:42:51,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 09:42:51,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:42:52,270 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 09:42:52,271 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 09:42:52,272 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 431 treesize of output 519 [2019-11-22 09:42:52,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:52,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:53,513 WARN L192 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 65 [2019-11-22 09:42:53,517 INFO L567 ElimStorePlain]: treesize reduction 21705, result has 0.7 percent of original size [2019-11-22 09:42:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,522 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 09:42:53,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:143, output treesize:162 [2019-11-22 09:42:53,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:53,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:42:54,081 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-11-22 09:42:54,105 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 0 case distinctions, treesize of input 88 treesize of output 44 [2019-11-22 09:42:54,107 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 09:42:54,225 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-22 09:42:54,226 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.0 percent of original size [2019-11-22 09:42:54,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:42:54,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:120, output treesize:66 [2019-11-22 09:42:54,283 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 09:42:54,284 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:42:54,846 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-22 09:42:54,859 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 09:42:54,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1486861487] [2019-11-22 09:42:54,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:42:54,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:42:54,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044562598] [2019-11-22 09:42:54,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:42:54,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:42:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:42:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:42:54,861 INFO L87 Difference]: Start difference. First operand 142 states and 205 transitions. Second operand 8 states. [2019-11-22 09:42:55,115 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-22 09:42:55,351 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-22 09:42:55,683 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-11-22 09:42:56,608 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-11-22 09:42:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:42:57,292 INFO L93 Difference]: Finished difference Result 293 states and 426 transitions. [2019-11-22 09:42:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:42:57,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 09:42:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:42:57,298 INFO L225 Difference]: With dead ends: 293 [2019-11-22 09:42:57,299 INFO L226 Difference]: Without dead ends: 293 [2019-11-22 09:42:57,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 09:42:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-22 09:42:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 215. [2019-11-22 09:42:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-22 09:42:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 327 transitions. [2019-11-22 09:42:57,331 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 327 transitions. Word has length 10 [2019-11-22 09:42:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:42:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 327 transitions. [2019-11-22 09:42:57,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:42:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 327 transitions. [2019-11-22 09:42:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 09:42:57,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:42:57,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:42:57,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:42:57,542 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:42:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:42:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash -88518740, now seen corresponding path program 1 times [2019-11-22 09:42:57,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:42:57,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1348827925] [2019-11-22 09:42:57,545 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 09:42:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:42:57,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:42:57,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:42:57,988 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_72|]} [2019-11-22 09:42:58,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:58,341 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 09:42:58,342 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 09:42:58,342 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 09:42:58,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:58,625 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 09:42:58,625 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 09:42:58,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:42:58,693 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 280 treesize of output 302 [2019-11-22 09:42:58,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:58,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,245 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-11-22 09:42:59,245 INFO L567 ElimStorePlain]: treesize reduction 2384, result has 6.1 percent of original size [2019-11-22 09:42:59,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,255 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 09:42:59,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 09:42:59,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:42:59,428 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:42:59,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:59,453 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 131 treesize of output 119 [2019-11-22 09:42:59,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:42:59,482 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 128 treesize of output 128 [2019-11-22 09:42:59,484 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 09:42:59,503 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 126 treesize of output 114 [2019-11-22 09:42:59,504 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:59,542 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 130 treesize of output 118 [2019-11-22 09:42:59,542 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:42:59,577 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 128 treesize of output 128 [2019-11-22 09:42:59,578 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,587 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:42:59,588 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,619 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 123 treesize of output 111 [2019-11-22 09:42:59,620 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,636 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:42:59,637 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,663 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 123 treesize of output 111 [2019-11-22 09:42:59,664 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:42:59,706 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 131 treesize of output 131 [2019-11-22 09:42:59,707 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 09:42:59,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:42:59,728 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 09:42:59,729 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:00,246 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 09:43:00,247 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 09:43:00,250 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 09:43:00,251 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 09:43:00,537 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 09:43:00,804 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 09:43:00,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:43:00,852 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 81 treesize of output 61 [2019-11-22 09:43:00,853 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 09:43:01,049 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 09:43:01,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,071 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 58 treesize of output 50 [2019-11-22 09:43:01,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:01,241 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 09:43:01,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-11-22 09:43:01,255 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:01,412 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 09:43:01,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,423 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 86 treesize of output 58 [2019-11-22 09:43:01,425 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:01,576 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 09:43:01,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-11-22 09:43:01,595 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:01,732 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 09:43:01,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,744 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 70 treesize of output 50 [2019-11-22 09:43:01,745 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:01,880 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 09:43:01,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:01,882 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 09:43:01,882 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 09:43:02,055 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-11-22 09:43:02,064 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 09:43:02,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:02,335 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:43:02,562 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:43:02,777 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 09:43:02,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348827925] [2019-11-22 09:43:02,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:02,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 09:43:02,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143675410] [2019-11-22 09:43:02,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 09:43:02,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 09:43:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 09:43:02,779 INFO L87 Difference]: Start difference. First operand 215 states and 327 transitions. Second operand 9 states. [2019-11-22 09:43:03,145 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 09:43:03,544 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 09:43:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:05,225 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2019-11-22 09:43:05,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:43:05,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 09:43:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:05,232 INFO L225 Difference]: With dead ends: 397 [2019-11-22 09:43:05,233 INFO L226 Difference]: Without dead ends: 397 [2019-11-22 09:43:05,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 09:43:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-22 09:43:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 328. [2019-11-22 09:43:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 09:43:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-11-22 09:43:05,269 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 11 [2019-11-22 09:43:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-11-22 09:43:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 09:43:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-11-22 09:43:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 09:43:05,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:05,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:05,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:05,474 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1550886470, now seen corresponding path program 1 times [2019-11-22 09:43:05,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:05,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1468298250] [2019-11-22 09:43:05,476 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 09:43:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:05,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 09:43:05,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:06,142 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2019-11-22 09:43:06,143 INFO L343 Elim1Store]: treesize reduction 355, result has 16.1 percent of original size [2019-11-22 09:43:06,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 193 treesize of output 235 [2019-11-22 09:43:06,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:06,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:06,365 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-11-22 09:43:06,366 INFO L567 ElimStorePlain]: treesize reduction 331, result has 20.8 percent of original size [2019-11-22 09:43:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,368 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 09:43:06,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:87 [2019-11-22 09:43:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:06,847 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-11-22 09:43:06,937 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 09:43:06,938 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:07,128 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 09:43:07,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1468298250] [2019-11-22 09:43:07,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:07,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:43:07,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425470215] [2019-11-22 09:43:07,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:43:07,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:43:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:43:07,130 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 10 states. [2019-11-22 09:43:12,245 WARN L192 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-11-22 09:43:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:13,062 INFO L93 Difference]: Finished difference Result 435 states and 652 transitions. [2019-11-22 09:43:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 09:43:13,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 09:43:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:13,067 INFO L225 Difference]: With dead ends: 435 [2019-11-22 09:43:13,067 INFO L226 Difference]: Without dead ends: 435 [2019-11-22 09:43:13,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:43:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-22 09:43:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 361. [2019-11-22 09:43:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-22 09:43:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 566 transitions. [2019-11-22 09:43:13,099 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 566 transitions. Word has length 12 [2019-11-22 09:43:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:13,100 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 566 transitions. [2019-11-22 09:43:13,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:43:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 566 transitions. [2019-11-22 09:43:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 09:43:13,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:13,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:13,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:13,310 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 832840430, now seen corresponding path program 1 times [2019-11-22 09:43:13,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:13,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1275030029] [2019-11-22 09:43:13,311 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 09:43:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:13,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:43:13,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:13,737 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_88|]} [2019-11-22 09:43:13,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,816 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 09:43:13,817 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 09:43:13,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:13,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:13,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:13,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:13,926 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 137 treesize of output 137 [2019-11-22 09:43:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:13,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:14,164 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-22 09:43:14,164 INFO L567 ElimStorePlain]: treesize reduction 248, result has 20.0 percent of original size [2019-11-22 09:43:14,166 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 09:43:14,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 09:43:14,388 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 09:43:14,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:14,725 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 09:43:14,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275030029] [2019-11-22 09:43:14,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:14,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:43:14,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63525107] [2019-11-22 09:43:14,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:43:14,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:14,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:43:14,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:14,727 INFO L87 Difference]: Start difference. First operand 361 states and 566 transitions. Second operand 8 states. [2019-11-22 09:43:14,940 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 09:43:18,870 WARN L192 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 09:43:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:20,223 INFO L93 Difference]: Finished difference Result 425 states and 585 transitions. [2019-11-22 09:43:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:43:20,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 09:43:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:20,229 INFO L225 Difference]: With dead ends: 425 [2019-11-22 09:43:20,229 INFO L226 Difference]: Without dead ends: 425 [2019-11-22 09:43:20,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:43:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-22 09:43:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 363. [2019-11-22 09:43:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-22 09:43:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 562 transitions. [2019-11-22 09:43:20,264 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 562 transitions. Word has length 13 [2019-11-22 09:43:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 562 transitions. [2019-11-22 09:43:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:43:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 562 transitions. [2019-11-22 09:43:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:43:20,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:20,266 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:20,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:20,472 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 320994995, now seen corresponding path program 1 times [2019-11-22 09:43:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [250652325] [2019-11-22 09:43:20,474 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 09:43:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:21,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 09:43:21,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:21,230 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 24=[|v_#valid_96|]} [2019-11-22 09:43:21,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,345 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-22 09:43:21,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2019-11-22 09:43:21,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:21,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:21,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:21,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:21,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 490 treesize of output 490 [2019-11-22 09:43:21,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:21,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:22,308 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 54 [2019-11-22 09:43:22,309 INFO L567 ElimStorePlain]: treesize reduction 8377, result has 1.4 percent of original size [2019-11-22 09:43:22,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:22,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:119 [2019-11-22 09:43:22,713 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 78 treesize of output 42 [2019-11-22 09:43:22,714 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 09:43:22,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 09:43:22,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:22,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:22,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 09:43:22,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:126, output treesize:74 [2019-11-22 09:43:22,978 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 09:43:22,978 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:23,557 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 09:43:23,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [250652325] [2019-11-22 09:43:23,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:23,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-22 09:43:23,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690059425] [2019-11-22 09:43:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 09:43:23,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 09:43:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-22 09:43:23,560 INFO L87 Difference]: Start difference. First operand 363 states and 562 transitions. Second operand 11 states. [2019-11-22 09:43:23,891 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-22 09:43:24,139 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-11-22 09:43:24,473 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-11-22 09:43:24,755 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-11-22 09:43:25,182 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-11-22 09:43:25,983 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-22 09:43:26,204 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-11-22 09:43:26,644 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-22 09:43:27,081 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-22 09:43:27,635 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-11-22 09:43:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:29,628 INFO L93 Difference]: Finished difference Result 508 states and 729 transitions. [2019-11-22 09:43:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 09:43:29,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 09:43:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:29,634 INFO L225 Difference]: With dead ends: 508 [2019-11-22 09:43:29,635 INFO L226 Difference]: Without dead ends: 508 [2019-11-22 09:43:29,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2019-11-22 09:43:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-22 09:43:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 398. [2019-11-22 09:43:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-22 09:43:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 618 transitions. [2019-11-22 09:43:29,661 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 618 transitions. Word has length 19 [2019-11-22 09:43:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:29,662 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 618 transitions. [2019-11-22 09:43:29,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 09:43:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 618 transitions. [2019-11-22 09:43:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 09:43:29,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:29,664 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 09:43:29,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:29,878 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash 774207653, now seen corresponding path program 1 times [2019-11-22 09:43:29,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:29,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1287650322] [2019-11-22 09:43:29,879 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 09:43:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:30,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:43:30,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:30,141 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 09:43:30,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:30,147 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 09:43:30,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287650322] [2019-11-22 09:43:30,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:30,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:43:30,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346256780] [2019-11-22 09:43:30,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:30,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:30,149 INFO L87 Difference]: Start difference. First operand 398 states and 618 transitions. Second operand 3 states. [2019-11-22 09:43:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:30,155 INFO L93 Difference]: Finished difference Result 374 states and 579 transitions. [2019-11-22 09:43:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:30,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 09:43:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:30,159 INFO L225 Difference]: With dead ends: 374 [2019-11-22 09:43:30,159 INFO L226 Difference]: Without dead ends: 374 [2019-11-22 09:43:30,160 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 09:43:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-22 09:43:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2019-11-22 09:43:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-22 09:43:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2019-11-22 09:43:30,179 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 23 [2019-11-22 09:43:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:30,180 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2019-11-22 09:43:30,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2019-11-22 09:43:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 09:43:30,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:30,181 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 09:43:30,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:30,385 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash 774207429, now seen corresponding path program 1 times [2019-11-22 09:43:30,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:30,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [623678397] [2019-11-22 09:43:30,387 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 09:43:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:30,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:43:30,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:30,641 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 09:43:30,642 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:30,657 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 09:43:30,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [623678397] [2019-11-22 09:43:30,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:30,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:43:30,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198202356] [2019-11-22 09:43:30,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:30,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:30,660 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand 3 states. [2019-11-22 09:43:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:30,690 INFO L93 Difference]: Finished difference Result 542 states and 846 transitions. [2019-11-22 09:43:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:30,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 09:43:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:30,694 INFO L225 Difference]: With dead ends: 542 [2019-11-22 09:43:30,694 INFO L226 Difference]: Without dead ends: 542 [2019-11-22 09:43:30,695 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 09:43:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-22 09:43:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 524. [2019-11-22 09:43:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-22 09:43:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 823 transitions. [2019-11-22 09:43:30,720 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 823 transitions. Word has length 23 [2019-11-22 09:43:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:30,722 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 823 transitions. [2019-11-22 09:43:30,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 823 transitions. [2019-11-22 09:43:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 09:43:30,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:30,726 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 09:43:30,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:30,937 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1769373397, now seen corresponding path program 1 times [2019-11-22 09:43:30,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:30,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1338583351] [2019-11-22 09:43:30,939 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 09:43:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:31,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 09:43:31,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:31,208 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 09:43:31,208 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:31,240 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 09:43:31,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338583351] [2019-11-22 09:43:31,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:31,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:43:31,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846309132] [2019-11-22 09:43:31,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:43:31,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:43:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:43:31,242 INFO L87 Difference]: Start difference. First operand 524 states and 823 transitions. Second operand 4 states. [2019-11-22 09:43:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:31,403 INFO L93 Difference]: Finished difference Result 618 states and 921 transitions. [2019-11-22 09:43:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:43:31,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 09:43:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:31,408 INFO L225 Difference]: With dead ends: 618 [2019-11-22 09:43:31,409 INFO L226 Difference]: Without dead ends: 618 [2019-11-22 09:43:31,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:43:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-22 09:43:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 589. [2019-11-22 09:43:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-22 09:43:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 910 transitions. [2019-11-22 09:43:31,440 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 910 transitions. Word has length 24 [2019-11-22 09:43:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:31,440 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 910 transitions. [2019-11-22 09:43:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:43:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 910 transitions. [2019-11-22 09:43:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 09:43:31,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:31,442 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:31,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:31,647 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:31,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1420785925, now seen corresponding path program 1 times [2019-11-22 09:43:31,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:31,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1765405837] [2019-11-22 09:43:31,649 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 09:43:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:32,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:43:32,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:32,063 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 09:43:32,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:32,118 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 09:43:32,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765405837] [2019-11-22 09:43:32,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:32,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 09:43:32,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605392497] [2019-11-22 09:43:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:43:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:43:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:43:32,121 INFO L87 Difference]: Start difference. First operand 589 states and 910 transitions. Second operand 8 states. [2019-11-22 09:43:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:32,288 INFO L93 Difference]: Finished difference Result 613 states and 948 transitions. [2019-11-22 09:43:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:43:32,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 09:43:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:32,293 INFO L225 Difference]: With dead ends: 613 [2019-11-22 09:43:32,293 INFO L226 Difference]: Without dead ends: 613 [2019-11-22 09:43:32,293 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 09:43:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-22 09:43:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 534. [2019-11-22 09:43:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-22 09:43:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 773 transitions. [2019-11-22 09:43:32,321 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 773 transitions. Word has length 25 [2019-11-22 09:43:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:32,322 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 773 transitions. [2019-11-22 09:43:32,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:43:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 773 transitions. [2019-11-22 09:43:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:43:32,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:32,325 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 09:43:32,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:32,530 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1457748217, now seen corresponding path program 1 times [2019-11-22 09:43:32,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:32,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2025232143] [2019-11-22 09:43:32,532 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 09:43:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:32,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:43:32,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:32,799 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 09:43:32,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:32,843 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 09:43:32,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025232143] [2019-11-22 09:43:32,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:32,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:43:32,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993045997] [2019-11-22 09:43:32,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:32,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:32,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:32,849 INFO L87 Difference]: Start difference. First operand 534 states and 773 transitions. Second operand 3 states. [2019-11-22 09:43:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:32,858 INFO L93 Difference]: Finished difference Result 379 states and 534 transitions. [2019-11-22 09:43:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:32,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 09:43:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:32,862 INFO L225 Difference]: With dead ends: 379 [2019-11-22 09:43:32,862 INFO L226 Difference]: Without dead ends: 379 [2019-11-22 09:43:32,863 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 09:43:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-22 09:43:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-11-22 09:43:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-22 09:43:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 534 transitions. [2019-11-22 09:43:32,878 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 534 transitions. Word has length 33 [2019-11-22 09:43:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:32,879 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 534 transitions. [2019-11-22 09:43:32,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 534 transitions. [2019-11-22 09:43:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:43:32,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:32,886 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 09:43:33,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:33,097 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1677657770, now seen corresponding path program 1 times [2019-11-22 09:43:33,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:33,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [616938323] [2019-11-22 09:43:33,098 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 09:43:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:33,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:43:33,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:33,995 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:43:33,996 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:43:33,996 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 09:43:33,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:34,138 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 09:43:34,142 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 09:43:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,145 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 09:43:34,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 09:43:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:34,669 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 09:43:34,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:34,670 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 09:43:34,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:34,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:34,833 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 09:43:34,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,010 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 09:43:35,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:35,011 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 09:43:35,012 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,020 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:35,021 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,025 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:35,025 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,031 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:43:35,031 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,216 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 09:43:35,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:35,217 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 09:43:35,218 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:35,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:35,307 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 09:43:35,308 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 09:43:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:35,502 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 09:43:35,585 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 09:43:35,585 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:35,819 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 09:43:35,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [616938323] [2019-11-22 09:43:35,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:43:35,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 09:43:35,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617272063] [2019-11-22 09:43:35,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 09:43:35,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 09:43:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:43:35,821 INFO L87 Difference]: Start difference. First operand 379 states and 534 transitions. Second operand 14 states. [2019-11-22 09:43:39,528 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 09:43:43,285 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 09:43:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:44,999 INFO L93 Difference]: Finished difference Result 481 states and 644 transitions. [2019-11-22 09:43:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 09:43:44,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 09:43:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:45,004 INFO L225 Difference]: With dead ends: 481 [2019-11-22 09:43:45,004 INFO L226 Difference]: Without dead ends: 475 [2019-11-22 09:43:45,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 09:43:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-22 09:43:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 423. [2019-11-22 09:43:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-22 09:43:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 588 transitions. [2019-11-22 09:43:45,018 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 588 transitions. Word has length 33 [2019-11-22 09:43:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:45,019 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 588 transitions. [2019-11-22 09:43:45,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 09:43:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 588 transitions. [2019-11-22 09:43:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 09:43:45,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:45,020 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 09:43:45,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:45,226 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, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 09:43:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1915451196, now seen corresponding path program 1 times [2019-11-22 09:43:45,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:45,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [871506244] [2019-11-22 09:43:45,228 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 09:43:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:45,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 09:43:45,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:46,336 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:43:46,337 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:43:46,338 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 09:43:46,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:46,478 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 09:43:46,478 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 09:43:46,479 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 09:43:46,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 09:43:46,495 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 09:43:46,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:46,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:46,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:43:46,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 09:43:46,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:43:46,560 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 09:43:46,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:46,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:43:46,583 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 09:43:46,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2019-11-22 09:43:46,670 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 09:43:46,670 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:46,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:47,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 09:43:47,852 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 09:43:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:43:47,859 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2019-11-22 09:43:48,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:48,084 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 09:43:48,093 INFO L168 Benchmark]: Toolchain (without parser) took 62487.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.3 MB). Free memory was 956.3 MB in the beginning and 970.6 MB in the end (delta: -14.3 MB). Peak memory consumption was 413.0 MB. Max. memory is 11.5 GB. [2019-11-22 09:43:48,093 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:43:48,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 09:43:48,094 INFO L168 Benchmark]: Boogie Preprocessor took 86.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:43:48,094 INFO L168 Benchmark]: RCFGBuilder took 883.22 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2019-11-22 09:43:48,095 INFO L168 Benchmark]: TraceAbstraction took 60811.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.7 MB). Free memory was 1.0 GB in the beginning and 970.6 MB in the end (delta: 69.2 MB). Peak memory consumption was 353.9 MB. Max. memory is 11.5 GB. [2019-11-22 09:43:48,097 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.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 701.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 883.22 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60811.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.7 MB). Free memory was 1.0 GB in the beginning and 970.6 MB in the end (delta: 69.2 MB). Peak memory consumption was 353.9 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...