./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.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_3.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 b34e199f0da2018b0ae97fc3f9a24725315a1b16 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:43:50,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:43:50,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:43:50,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:43:50,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:43:50,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:43:50,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:43:50,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:43:50,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:43:50,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:43:50,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:43:50,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:43:50,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:43:50,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:43:50,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:43:50,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:43:50,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:43:50,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:43:50,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:43:50,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:43:50,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:43:50,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:43:50,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:43:50,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:43:50,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:43:50,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:43:50,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:43:50,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:43:50,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:43:50,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:43:50,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:43:50,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:43:50,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:43:50,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:43:50,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:43:50,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:43:50,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:43:50,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:43:50,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:43:50,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:43:50,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:43:50,473 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:43:50,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:43:50,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:43:50,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:43:50,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:43:50,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:43:50,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:43:50,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:43:50,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:43:50,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:43:50,530 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:43:50,530 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:43:50,530 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 09:43:50,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:43:50,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:43:50,532 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:43:50,532 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:43:50,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:43:50,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:43:50,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:43:50,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:43:50,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:43:50,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:43:50,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:43:50,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:43:50,536 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:43:50,536 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:43:50,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:43:50,537 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 -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-22 09:43:50,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:43:50,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:43:50,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:43:50,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:43:50,845 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:43:50,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 09:43:50,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b43174f9/839ae00810d2476db86e6dd9f250de14/FLAG095f3ec71 [2019-11-22 09:43:51,485 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:43:51,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 09:43:51,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b43174f9/839ae00810d2476db86e6dd9f250de14/FLAG095f3ec71 [2019-11-22 09:43:51,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b43174f9/839ae00810d2476db86e6dd9f250de14 [2019-11-22 09:43:51,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:43:51,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:43:51,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:43:51,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:43:51,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:43:51,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:43:51" (1/1) ... [2019-11-22 09:43:51,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:51, skipping insertion in model container [2019-11-22 09:43:51,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:43:51" (1/1) ... [2019-11-22 09:43:51,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:43:51,821 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:43:52,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:43:52,242 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:43:52,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:43:52,396 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:43:52,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52 WrapperNode [2019-11-22 09:43:52,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:43:52,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:43:52,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:43:52,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:43:52,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (1/1) ... [2019-11-22 09:43:52,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:43:52,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:43:52,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:43:52,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:43:52,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (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:43:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:43:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:43:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 09:43:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:43:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:43:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:43:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 09:43:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 09:43:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 09:43:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:43:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:43:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:43:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:43:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:43:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:43:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:43:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:43:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:43:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:43:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:43:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:43:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:43:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:43:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:43:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:43:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:43:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:43:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:43:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:43:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:43:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:43:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:43:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:43:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:43:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:43:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:43:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:43:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:43:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:43:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:43:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:43:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:43:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:43:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:43:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:43:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:43:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:43:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:43:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:43:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:43:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:43:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:43:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:43:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:43:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:43:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:43:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:43:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:43:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:43:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:43:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:43:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:43:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:43:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:43:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:43:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:43:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 09:43:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:43:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:43:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:43:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:43:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:43:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:43:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:43:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:43:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:43:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:43:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:43:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:43:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:43:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:43:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:43:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:43:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:43:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:43:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:43:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:43:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:43:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:43:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:43:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:43:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:43:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:43:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:43:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:43:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:43:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:43:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:43:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:43:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:43:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 09:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 09:43:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 09:43:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 09:43:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 09:43:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 09:43:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 09:43:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 09:43:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 09:43:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 09:43:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 09:43:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 09:43:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 09:43:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 09:43:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 09:43:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 09:43:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 09:43:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 09:43:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 09:43:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 09:43:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 09:43:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 09:43:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 09:43:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 09:43:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 09:43:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 09:43:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 09:43:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 09:43:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 09:43:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 09:43:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 09:43:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 09:43:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 09:43:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 09:43:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 09:43:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 09:43:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 09:43:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 09:43:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 09:43:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 09:43:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 09:43:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 09:43:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 09:43:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 09:43:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:43:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 09:43:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 09:43:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:43:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 09:43:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:43:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:43:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:43:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:43:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 09:43:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 09:43:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:43:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:43:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 09:43:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:43:53,463 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:43:53,463 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 09:43:53,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:53 BoogieIcfgContainer [2019-11-22 09:43:53,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:43:53,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:43:53,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:43:53,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:43:53,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:43:51" (1/3) ... [2019-11-22 09:43:53,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728aa494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:53, skipping insertion in model container [2019-11-22 09:43:53,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:43:52" (2/3) ... [2019-11-22 09:43:53,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728aa494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:53, skipping insertion in model container [2019-11-22 09:43:53,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:53" (3/3) ... [2019-11-22 09:43:53,473 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 09:43:53,484 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:43:53,492 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 09:43:53,503 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 09:43:53,520 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:43:53,521 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:43:53,521 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:43:53,521 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:43:53,521 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:43:53,521 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:43:53,521 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:43:53,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:43:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 09:43:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:43:53,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:53,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:53,549 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, 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:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 09:43:53,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:53,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [273252445] [2019-11-22 09:43:53,567 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:43:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:53,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:43:53,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:54,375 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:43:54,378 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:43:54,379 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:43:54,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:54,481 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 09:43:54,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:54,499 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:43:54,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 09:43:54,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:54,549 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:54,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:54,591 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:54,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273252445] [2019-11-22 09:43:54,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:54,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:43:54,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075934221] [2019-11-22 09:43:54,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:43:54,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:43:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:43:54,621 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 09:43:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:54,789 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-22 09:43:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:43:54,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 09:43:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:54,819 INFO L225 Difference]: With dead ends: 88 [2019-11-22 09:43:54,819 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 09:43:54,822 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:43:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 09:43:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-22 09:43:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 09:43:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-22 09:43:54,885 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 9 [2019-11-22 09:43:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:54,885 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-22 09:43:54,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:43:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-22 09:43:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:43:54,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:54,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:55,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:55,096 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, 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:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 09:43:55,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:55,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1643960389] [2019-11-22 09:43:55,099 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:43:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:55,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:43:55,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:55,903 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:43:55,904 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:43:55,905 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:55,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:56,047 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 09:43:56,048 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 09:43:56,051 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:56,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 09:43:56,090 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:56,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:43:56,226 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-11-22 09:43:56,351 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:56,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1643960389] [2019-11-22 09:43:56,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:43:56,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:43:56,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108982751] [2019-11-22 09:43:56,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:43:56,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:43:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:43:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:43:56,354 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-22 09:43:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:43:57,091 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2019-11-22 09:43:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:43:57,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 09:43:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:43:57,095 INFO L225 Difference]: With dead ends: 164 [2019-11-22 09:43:57,095 INFO L226 Difference]: Without dead ends: 164 [2019-11-22 09:43:57,096 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:43:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-22 09:43:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2019-11-22 09:43:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-22 09:43:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2019-11-22 09:43:57,130 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 9 [2019-11-22 09:43:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:43:57,135 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2019-11-22 09:43:57,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:43:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2019-11-22 09:43:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:43:57,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:43:57,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:43:57,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:43:57,337 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, 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:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:43:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 09:43:57,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:43:57,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1955038747] [2019-11-22 09:43:57,340 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:43:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:43:57,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 09:43:57,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:43:58,418 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 09:43:58,419 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 09:43:58,420 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 325 treesize of output 419 [2019-11-22 09:43:58,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:43:58,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:43:59,490 WARN L192 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 09:43:59,493 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 09:43:59,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,500 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:43:59,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 09:43:59,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:43:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:00,097 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 09:44:00,142 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:44:00,144 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:44:00,267 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 09:44:00,268 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 09:44:00,270 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:44:00,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 09:44:00,334 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:44:00,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:00,733 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:44:00,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955038747] [2019-11-22 09:44:00,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:00,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:44:00,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514939432] [2019-11-22 09:44:00,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:00,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:00,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:00,736 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand 8 states. [2019-11-22 09:44:00,990 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-22 09:44:01,264 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 09:44:01,618 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 09:44:02,346 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 09:44:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:03,018 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2019-11-22 09:44:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 09:44:03,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 09:44:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:03,026 INFO L225 Difference]: With dead ends: 277 [2019-11-22 09:44:03,027 INFO L226 Difference]: Without dead ends: 277 [2019-11-22 09:44:03,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 09:44:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-22 09:44:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2019-11-22 09:44:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-22 09:44:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-11-22 09:44:03,067 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 10 [2019-11-22 09:44:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:03,067 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-11-22 09:44:03,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-11-22 09:44:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 09:44:03,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:03,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:03,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:03,273 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, 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:44:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 09:44:03,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:03,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1148330226] [2019-11-22 09:44:03,275 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:44:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:03,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:44:03,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:03,759 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 09:44:03,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:03,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:04,111 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 09:44:04,112 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 09:44:04,113 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:44:04,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:04,383 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 09:44:04,384 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 09:44:04,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:04,455 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 266 treesize of output 288 [2019-11-22 09:44:04,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:04,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,177 WARN L192 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 09:44:05,178 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 09:44:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,183 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:44:05,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 09:44:05,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:05,384 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:05,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:05,411 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:44:05,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:05,449 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:44:05,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:05,476 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:44:05,476 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 09:44:05,500 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:44:05,501 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:05,531 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:44:05,532 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,541 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:05,541 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,572 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:44:05,573 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,582 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:05,582 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,605 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:44:05,606 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:05,638 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:44:05,638 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:05,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:05,656 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:44:05,657 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:06,169 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 09:44:06,169 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 09:44:06,172 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:44:06,173 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 09:44:06,458 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 09:44:06,818 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 09:44:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:06,860 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:44:06,861 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:44:07,119 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 09:44:07,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,143 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:44:07,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:07,320 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 09:44:07,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-11-22 09:44:07,335 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:07,514 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 09:44:07,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,527 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:44:07,529 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:44:07,686 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 09:44:07,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,710 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:44:07,710 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:07,842 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 09:44:07,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,854 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:44:07,855 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:07,970 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 09:44:07,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:07,972 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:44:07,973 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 09:44:08,112 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:44:08,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:08,463 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:44:08,588 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:44:08,695 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 09:44:08,731 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:44:08,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1148330226] [2019-11-22 09:44:08,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:08,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 09:44:08,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697044845] [2019-11-22 09:44:08,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 09:44:08,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:08,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 09:44:08,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 09:44:08,733 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 9 states. [2019-11-22 09:44:09,158 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 09:44:09,564 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 09:44:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:11,372 INFO L93 Difference]: Finished difference Result 355 states and 474 transitions. [2019-11-22 09:44:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:44:11,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 09:44:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:11,379 INFO L225 Difference]: With dead ends: 355 [2019-11-22 09:44:11,379 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 09:44:11,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 09:44:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 09:44:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2019-11-22 09:44:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-22 09:44:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2019-11-22 09:44:11,411 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 11 [2019-11-22 09:44:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:11,411 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2019-11-22 09:44:11,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 09:44:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2019-11-22 09:44:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 09:44:11,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:11,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:11,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:11,619 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, 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:44:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 09:44:11,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:11,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [596427419] [2019-11-22 09:44:11,621 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:44:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:12,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:44:12,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:12,362 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 09:44:12,363 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 09:44:12,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 09:44:12,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:12,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:13,756 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 09:44:13,757 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 09:44:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:13,760 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:44:13,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 09:44:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:14,209 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 09:44:14,346 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:44:14,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:14,566 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:44:14,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [596427419] [2019-11-22 09:44:14,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:14,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:44:14,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812030054] [2019-11-22 09:44:14,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:44:14,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:14,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:44:14,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:44:14,568 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand 10 states. [2019-11-22 09:44:15,613 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 09:44:16,664 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 09:44:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:17,697 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2019-11-22 09:44:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 09:44:17,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 09:44:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:17,703 INFO L225 Difference]: With dead ends: 373 [2019-11-22 09:44:17,703 INFO L226 Difference]: Without dead ends: 373 [2019-11-22 09:44:17,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:44:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-22 09:44:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 313. [2019-11-22 09:44:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-22 09:44:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 458 transitions. [2019-11-22 09:44:17,727 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 458 transitions. Word has length 12 [2019-11-22 09:44:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:17,727 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 458 transitions. [2019-11-22 09:44:17,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:44:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 458 transitions. [2019-11-22 09:44:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 09:44:17,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:17,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:17,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:17,941 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, 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:44:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 09:44:17,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:17,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [803178905] [2019-11-22 09:44:17,943 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:44:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:18,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:44:18,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:18,390 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 09:44:18,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,503 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 09:44:18,503 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:44:18,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:18,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:18,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:18,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:18,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 09:44:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:18,846 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 09:44:18,847 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 09:44:18,848 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:44:18,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 09:44:19,072 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:44:19,072 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:19,319 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:44:19,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803178905] [2019-11-22 09:44:19,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:19,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:44:19,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215087455] [2019-11-22 09:44:19,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:19,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:19,322 INFO L87 Difference]: Start difference. First operand 313 states and 458 transitions. Second operand 8 states. [2019-11-22 09:44:19,490 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 09:44:23,994 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 09:44:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:25,094 INFO L93 Difference]: Finished difference Result 372 states and 471 transitions. [2019-11-22 09:44:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:44:25,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 09:44:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:25,098 INFO L225 Difference]: With dead ends: 372 [2019-11-22 09:44:25,098 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 09:44:25,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:44:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 09:44:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2019-11-22 09:44:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-22 09:44:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 453 transitions. [2019-11-22 09:44:25,124 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 453 transitions. Word has length 13 [2019-11-22 09:44:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:25,124 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 453 transitions. [2019-11-22 09:44:25,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 453 transitions. [2019-11-22 09:44:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:44:25,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:25,126 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:44:25,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:25,331 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, 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:44:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 09:44:25,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:25,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1021295958] [2019-11-22 09:44:25,333 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:44:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:25,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 09:44:25,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:25,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 09:44:25,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:25,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:26,225 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 09:44:26,226 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 09:44:26,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 09:44:26,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:26,459 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 09:44:26,459 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 09:44:26,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:26,528 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 392 treesize of output 402 [2019-11-22 09:44:26,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:27,793 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 09:44:27,794 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 09:44:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:27,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 09:44:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:27,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:28,605 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 09:44:29,052 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 09:44:29,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:29,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2019-11-22 09:44:29,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,474 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 09:44:29,475 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 09:44:29,491 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 72 treesize of output 56 [2019-11-22 09:44:29,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,607 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 09:44:29,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2019-11-22 09:44:29,621 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-22 09:44:29,719 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 09:44:29,817 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 09:44:29,899 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:44:29,899 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:30,384 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:44:30,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021295958] [2019-11-22 09:44:30,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:44:30,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 09:44:30,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782321231] [2019-11-22 09:44:30,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:44:30,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:44:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:44:30,386 INFO L87 Difference]: Start difference. First operand 314 states and 453 transitions. Second operand 10 states. [2019-11-22 09:44:30,753 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 09:44:31,458 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 09:44:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:34,206 INFO L93 Difference]: Finished difference Result 442 states and 590 transitions. [2019-11-22 09:44:34,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 09:44:34,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 09:44:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:34,212 INFO L225 Difference]: With dead ends: 442 [2019-11-22 09:44:34,215 INFO L226 Difference]: Without dead ends: 442 [2019-11-22 09:44:34,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:44:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-22 09:44:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 343. [2019-11-22 09:44:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 09:44:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2019-11-22 09:44:34,248 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 19 [2019-11-22 09:44:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:34,248 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2019-11-22 09:44:34,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:44:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2019-11-22 09:44:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 09:44:34,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:34,250 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:44:34,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:34,456 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, 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:44:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602239, now seen corresponding path program 1 times [2019-11-22 09:44:34,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:34,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1260891119] [2019-11-22 09:44:34,457 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:44:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:34,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:44:34,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:34,724 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:44:34,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:34,736 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:44:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1260891119] [2019-11-22 09:44:34,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:34,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:44:34,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617187336] [2019-11-22 09:44:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:44:34,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:44:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:44:34,738 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand 3 states. [2019-11-22 09:44:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:34,766 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2019-11-22 09:44:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:44:34,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 09:44:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:34,772 INFO L225 Difference]: With dead ends: 504 [2019-11-22 09:44:34,772 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 09:44:34,772 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:44:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 09:44:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 487. [2019-11-22 09:44:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-22 09:44:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 730 transitions. [2019-11-22 09:44:34,799 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 730 transitions. Word has length 23 [2019-11-22 09:44:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:34,800 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 730 transitions. [2019-11-22 09:44:34,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:44:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 730 transitions. [2019-11-22 09:44:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 09:44:34,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:34,801 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:44:35,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:35,004 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, 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:44:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602463, now seen corresponding path program 1 times [2019-11-22 09:44:35,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:35,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1603621798] [2019-11-22 09:44:35,005 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:44:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:35,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:44:35,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:35,267 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:44:35,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:35,273 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:44:35,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1603621798] [2019-11-22 09:44:35,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:35,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:44:35,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184506764] [2019-11-22 09:44:35,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:44:35,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:44:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:44:35,275 INFO L87 Difference]: Start difference. First operand 487 states and 730 transitions. Second operand 3 states. [2019-11-22 09:44:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:35,283 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-11-22 09:44:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:44:35,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 09:44:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:35,287 INFO L225 Difference]: With dead ends: 455 [2019-11-22 09:44:35,287 INFO L226 Difference]: Without dead ends: 455 [2019-11-22 09:44:35,288 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:44:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-22 09:44:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-22 09:44:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-22 09:44:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2019-11-22 09:44:35,314 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 23 [2019-11-22 09:44:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:35,316 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2019-11-22 09:44:35,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:44:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2019-11-22 09:44:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 09:44:35,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:35,319 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:44:35,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:35,524 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, 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:44:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:35,524 INFO L82 PathProgramCache]: Analyzing trace with hash -494938069, now seen corresponding path program 1 times [2019-11-22 09:44:35,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:35,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [33446592] [2019-11-22 09:44:35,525 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:44:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:35,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 09:44:35,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:35,794 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:44:35,794 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:35,838 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:44:35,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [33446592] [2019-11-22 09:44:35,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:35,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:44:35,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467435947] [2019-11-22 09:44:35,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:35,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:35,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:35,840 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2019-11-22 09:44:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:35,997 INFO L93 Difference]: Finished difference Result 546 states and 773 transitions. [2019-11-22 09:44:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:44:35,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 09:44:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:36,004 INFO L225 Difference]: With dead ends: 546 [2019-11-22 09:44:36,004 INFO L226 Difference]: Without dead ends: 546 [2019-11-22 09:44:36,005 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:44:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-22 09:44:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2019-11-22 09:44:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-22 09:44:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 756 transitions. [2019-11-22 09:44:36,029 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 756 transitions. Word has length 24 [2019-11-22 09:44:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:36,030 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 756 transitions. [2019-11-22 09:44:36,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 756 transitions. [2019-11-22 09:44:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 09:44:36,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:36,037 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:44:36,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:36,240 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, 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:44:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 09:44:36,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:36,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1324271190] [2019-11-22 09:44:36,242 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:44:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:36,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:44:36,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:36,625 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:44:36,625 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:36,671 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:44:36,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324271190] [2019-11-22 09:44:36,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:44:36,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 09:44:36,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506882472] [2019-11-22 09:44:36,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:36,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:36,673 INFO L87 Difference]: Start difference. First operand 515 states and 756 transitions. Second operand 8 states. [2019-11-22 09:44:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:36,841 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2019-11-22 09:44:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:44:36,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 09:44:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:36,845 INFO L225 Difference]: With dead ends: 535 [2019-11-22 09:44:36,845 INFO L226 Difference]: Without dead ends: 535 [2019-11-22 09:44:36,846 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:44:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-22 09:44:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 462. [2019-11-22 09:44:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-22 09:44:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2019-11-22 09:44:36,867 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 25 [2019-11-22 09:44:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:36,867 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2019-11-22 09:44:36,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2019-11-22 09:44:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:44:36,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:36,868 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:44:37,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:37,072 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, 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:44:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -71787967, now seen corresponding path program 1 times [2019-11-22 09:44:37,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:37,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1140474698] [2019-11-22 09:44:37,074 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:44:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:37,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 09:44:37,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:37,371 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:44:37,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:37,409 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:44:37,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1140474698] [2019-11-22 09:44:37,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:37,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 09:44:37,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502021604] [2019-11-22 09:44:37,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:44:37,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:44:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:44:37,411 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand 3 states. [2019-11-22 09:44:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:37,420 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-22 09:44:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:44:37,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 09:44:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:37,424 INFO L225 Difference]: With dead ends: 312 [2019-11-22 09:44:37,424 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 09:44:37,424 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:44:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 09:44:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-11-22 09:44:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-22 09:44:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2019-11-22 09:44:37,434 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 33 [2019-11-22 09:44:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:37,434 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2019-11-22 09:44:37,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:44:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2019-11-22 09:44:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 09:44:37,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:37,437 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:44:37,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:37,641 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, 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:44:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 09:44:37,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:37,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [640473955] [2019-11-22 09:44:37,644 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:44:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:38,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:44:38,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:38,510 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 09:44:38,510 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 09:44:38,511 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:44:38,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:38,639 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 09:44:38,639 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 09:44:38,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:38,641 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:44:38,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 09:44:38,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:38,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:38,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:38,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:39,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:39,104 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:44:39,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:39,258 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:44:39,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,428 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 09:44:39,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:39,429 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:44:39,430 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:39,435 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,438 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:39,439 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,445 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 09:44:39,446 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:39,550 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:44:39,551 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:39,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:39,618 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:44:39,618 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 09:44:39,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 09:44:39,834 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 09:44:39,906 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:44:39,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:40,150 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:44:40,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [640473955] [2019-11-22 09:44:40,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:44:40,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 09:44:40,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911303164] [2019-11-22 09:44:40,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 09:44:40,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 09:44:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:44:40,152 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 14 states. [2019-11-22 09:44:42,121 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 09:44:46,986 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 09:44:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:48,616 INFO L93 Difference]: Finished difference Result 396 states and 499 transitions. [2019-11-22 09:44:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 09:44:48,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 09:44:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:48,620 INFO L225 Difference]: With dead ends: 396 [2019-11-22 09:44:48,621 INFO L226 Difference]: Without dead ends: 390 [2019-11-22 09:44:48,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 09:44:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-22 09:44:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2019-11-22 09:44:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-22 09:44:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2019-11-22 09:44:48,633 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 33 [2019-11-22 09:44:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:48,634 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2019-11-22 09:44:48,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 09:44:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2019-11-22 09:44:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 09:44:48,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:48,635 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:44:48,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:48,841 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, 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:44:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1447512898, now seen corresponding path program 1 times [2019-11-22 09:44:48,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:48,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [766415294] [2019-11-22 09:44:48,842 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:44:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:49,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 09:44:49,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:49,882 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 09:44:49,883 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 09:44:49,883 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:44:49,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:50,025 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 09:44:50,026 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 09:44:50,027 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:44:50,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 09:44:50,047 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:44:50,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:50,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:50,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:50,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 09:44:50,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:50,124 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:44:50,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:50,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:50,170 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:44:50,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 09:44:50,261 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:44:50,262 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:50,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:50,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:50,926 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 09:44:51,456 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 09:44:51,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:51,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:51,678 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:44:51,682 INFO L168 Benchmark]: Toolchain (without parser) took 59927.89 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.1 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -251.4 MB). Peak memory consumption was 172.7 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:51,682 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:44:51,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:51,683 INFO L168 Benchmark]: Boogie Preprocessor took 99.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:51,683 INFO L168 Benchmark]: RCFGBuilder took 968.32 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:51,684 INFO L168 Benchmark]: TraceAbstraction took 58214.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.6 MB). Peak memory consumption was 118.1 MB. Max. memory is 11.5 GB. [2019-11-22 09:44:51,686 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 968.32 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58214.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.6 MB). Peak memory consumption was 118.1 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...