./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 34ebb1e4 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/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-34ebb1e [2019-11-21 16:21:20,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 16:21:20,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 16:21:20,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 16:21:20,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 16:21:20,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 16:21:20,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 16:21:20,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 16:21:20,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 16:21:20,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 16:21:20,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 16:21:20,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 16:21:20,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 16:21:20,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 16:21:20,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 16:21:20,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 16:21:20,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 16:21:20,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 16:21:20,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 16:21:20,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 16:21:20,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 16:21:20,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 16:21:20,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 16:21:20,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 16:21:20,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 16:21:20,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 16:21:20,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 16:21:20,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 16:21:20,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 16:21:20,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 16:21:20,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 16:21:20,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 16:21:20,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 16:21:20,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 16:21:20,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 16:21:20,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 16:21:20,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 16:21:20,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 16:21:20,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 16:21:20,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 16:21:20,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 16:21:20,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-21 16:21:20,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 16:21:20,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 16:21:20,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 16:21:20,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 16:21:20,422 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 16:21:20,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 16:21:20,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 16:21:20,425 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 16:21:20,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 16:21:20,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 16:21:20,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 16:21:20,426 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 16:21:20,426 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 16:21:20,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 16:21:20,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 16:21:20,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 16:21:20,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 16:21:20,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 16:21:20,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 16:21:20,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 16:21:20,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 16:21:20,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 16:21:20,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 16:21:20,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 16:21:20,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 16:21:20,431 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 16:21:20,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 16:21:20,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 16:21:20,431 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-21 16:21:20,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 16:21:20,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 16:21:20,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 16:21:20,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 16:21:20,799 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 16:21:20,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-21 16:21:20,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1387c55e1/7ceac6aa1ea143c5b3fc7eb412333503/FLAG1898611bc [2019-11-21 16:21:21,420 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 16:21:21,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-21 16:21:21,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1387c55e1/7ceac6aa1ea143c5b3fc7eb412333503/FLAG1898611bc [2019-11-21 16:21:21,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1387c55e1/7ceac6aa1ea143c5b3fc7eb412333503 [2019-11-21 16:21:21,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 16:21:21,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 16:21:21,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 16:21:21,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 16:21:21,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 16:21:21,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:21" (1/1) ... [2019-11-21 16:21:21,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164bacd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:21, skipping insertion in model container [2019-11-21 16:21:21,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:21" (1/1) ... [2019-11-21 16:21:21,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 16:21:21,811 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 16:21:22,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:21:22,382 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 16:21:22,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:21:22,541 INFO L205 MainTranslator]: Completed translation [2019-11-21 16:21:22,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22 WrapperNode [2019-11-21 16:21:22,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 16:21:22,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 16:21:22,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 16:21:22,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 16:21:22,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (1/1) ... [2019-11-21 16:21:22,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 16:21:22,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 16:21:22,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 16:21:22,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 16:21:22,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (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-21 16:21:22,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 16:21:22,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 16:21:22,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 16:21:22,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 16:21:22,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-21 16:21:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-21 16:21:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-21 16:21:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-21 16:21:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-21 16:21:22,706 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-21 16:21:22,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 16:21:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 16:21:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 16:21:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 16:21:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 16:21:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 16:21:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 16:21:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 16:21:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 16:21:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 16:21:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 16:21:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 16:21:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 16:21:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 16:21:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 16:21:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 16:21:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 16:21:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 16:21:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 16:21:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 16:21:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 16:21:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 16:21:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 16:21:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 16:21:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 16:21:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 16:21:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 16:21:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 16:21:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 16:21:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 16:21:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 16:21:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 16:21:22,723 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 16:21:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 16:21:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 16:21:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 16:21:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 16:21:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 16:21:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 16:21:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 16:21:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 16:21:22,728 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 16:21:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 16:21:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 16:21:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 16:21:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 16:21:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 16:21:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 16:21:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-21 16:21:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-21 16:21:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 16:21:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 16:21:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-21 16:21:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 16:21:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 16:21:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 16:21:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-21 16:21:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-21 16:21:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-21 16:21:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 16:21:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 16:21:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 16:21:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 16:21:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 16:21:24,216 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 16:21:24,216 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-21 16:21:24,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:24 BoogieIcfgContainer [2019-11-21 16:21:24,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 16:21:24,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 16:21:24,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 16:21:24,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 16:21:24,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:21:21" (1/3) ... [2019-11-21 16:21:24,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a5c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:24, skipping insertion in model container [2019-11-21 16:21:24,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:22" (2/3) ... [2019-11-21 16:21:24,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a5c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:24, skipping insertion in model container [2019-11-21 16:21:24,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:24" (3/3) ... [2019-11-21 16:21:24,232 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-21 16:21:24,254 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 16:21:24,264 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-21 16:21:24,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-21 16:21:24,298 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 16:21:24,299 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 16:21:24,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 16:21:24,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 16:21:24,299 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 16:21:24,299 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 16:21:24,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 16:21:24,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 16:21:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2019-11-21 16:21:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:21:24,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:24,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:24,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 256683086, now seen corresponding path program 1 times [2019-11-21 16:21:24,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1388926927] [2019-11-21 16:21:24,382 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-21 16:21:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:24,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 16:21:24,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:24,659 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-21 16:21:24,660 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:24,677 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-21 16:21:24,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1388926927] [2019-11-21 16:21:24,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:24,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 16:21:24,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393216] [2019-11-21 16:21:24,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 16:21:24,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 16:21:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 16:21:24,704 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 2 states. [2019-11-21 16:21:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:24,747 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2019-11-21 16:21:24,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 16:21:24,749 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-21 16:21:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:24,781 INFO L225 Difference]: With dead ends: 274 [2019-11-21 16:21:24,781 INFO L226 Difference]: Without dead ends: 257 [2019-11-21 16:21:24,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 16:21:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-21 16:21:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-11-21 16:21:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-21 16:21:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-11-21 16:21:24,896 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 9 [2019-11-21 16:21:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:24,897 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-11-21 16:21:24,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 16:21:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-11-21 16:21:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:21:24,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:24,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:25,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:25,109 INFO L410 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 256654256, now seen corresponding path program 1 times [2019-11-21 16:21:25,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:25,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [613960752] [2019-11-21 16:21:25,110 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-21 16:21:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:25,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 16:21:25,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:25,316 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-21 16:21:25,317 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:25,324 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-21 16:21:25,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [613960752] [2019-11-21 16:21:25,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:25,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 16:21:25,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103251437] [2019-11-21 16:21:25,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 16:21:25,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 16:21:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:21:25,328 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 3 states. [2019-11-21 16:21:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:25,976 INFO L93 Difference]: Finished difference Result 298 states and 320 transitions. [2019-11-21 16:21:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:21:25,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-21 16:21:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:25,979 INFO L225 Difference]: With dead ends: 298 [2019-11-21 16:21:25,979 INFO L226 Difference]: Without dead ends: 297 [2019-11-21 16:21:25,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-21 16:21:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-21 16:21:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 259. [2019-11-21 16:21:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-21 16:21:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 273 transitions. [2019-11-21 16:21:26,004 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 273 transitions. Word has length 9 [2019-11-21 16:21:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:26,004 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 273 transitions. [2019-11-21 16:21:26,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 16:21:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 273 transitions. [2019-11-21 16:21:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:21:26,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:26,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:26,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:26,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 256655262, now seen corresponding path program 1 times [2019-11-21 16:21:26,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:26,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1151352408] [2019-11-21 16:21:26,212 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-21 16:21:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:26,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 16:21:26,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:26,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:26,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:26,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:26,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:26,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:21:26,447 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-21 16:21:26,447 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:26,456 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-21 16:21:26,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151352408] [2019-11-21 16:21:26,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:26,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 16:21:26,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945073740] [2019-11-21 16:21:26,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 16:21:26,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 16:21:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:21:26,459 INFO L87 Difference]: Start difference. First operand 259 states and 273 transitions. Second operand 3 states. [2019-11-21 16:21:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:26,896 INFO L93 Difference]: Finished difference Result 276 states and 293 transitions. [2019-11-21 16:21:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:21:26,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-21 16:21:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:26,901 INFO L225 Difference]: With dead ends: 276 [2019-11-21 16:21:26,901 INFO L226 Difference]: Without dead ends: 276 [2019-11-21 16:21:26,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-21 16:21:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-21 16:21:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 257. [2019-11-21 16:21:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-21 16:21:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 271 transitions. [2019-11-21 16:21:26,916 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 271 transitions. Word has length 9 [2019-11-21 16:21:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:26,916 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 271 transitions. [2019-11-21 16:21:26,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 16:21:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 271 transitions. [2019-11-21 16:21:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 16:21:26,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:26,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:27,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:27,121 INFO L410 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 256655263, now seen corresponding path program 1 times [2019-11-21 16:21:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:27,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1182147747] [2019-11-21 16:21:27,126 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-21 16:21:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:27,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:21:27,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:27,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:27,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:27,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:27,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:27,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:21:27,369 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-21 16:21:27,369 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:27,406 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-21 16:21:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182147747] [2019-11-21 16:21:27,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:27,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 16:21:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30465665] [2019-11-21 16:21:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:27,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:27,408 INFO L87 Difference]: Start difference. First operand 257 states and 271 transitions. Second operand 4 states. [2019-11-21 16:21:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:28,306 INFO L93 Difference]: Finished difference Result 286 states and 304 transitions. [2019-11-21 16:21:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:21:28,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-21 16:21:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:28,310 INFO L225 Difference]: With dead ends: 286 [2019-11-21 16:21:28,310 INFO L226 Difference]: Without dead ends: 286 [2019-11-21 16:21:28,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-21 16:21:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-21 16:21:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 255. [2019-11-21 16:21:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-21 16:21:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 269 transitions. [2019-11-21 16:21:28,321 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 269 transitions. Word has length 9 [2019-11-21 16:21:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:28,321 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 269 transitions. [2019-11-21 16:21:28,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 269 transitions. [2019-11-21 16:21:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 16:21:28,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:28,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:28,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:28,525 INFO L410 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -656947946, now seen corresponding path program 1 times [2019-11-21 16:21:28,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:28,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1128597581] [2019-11-21 16:21:28,527 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-21 16:21:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:28,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 16:21:28,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:28,694 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-21 16:21:28,695 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:28,712 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-21 16:21:28,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128597581] [2019-11-21 16:21:28,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:28,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 16:21:28,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907243733] [2019-11-21 16:21:28,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 16:21:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 16:21:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:21:28,716 INFO L87 Difference]: Start difference. First operand 255 states and 269 transitions. Second operand 3 states. [2019-11-21 16:21:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:28,795 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2019-11-21 16:21:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:21:28,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-21 16:21:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:28,798 INFO L225 Difference]: With dead ends: 269 [2019-11-21 16:21:28,798 INFO L226 Difference]: Without dead ends: 268 [2019-11-21 16:21:28,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-21 16:21:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-21 16:21:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 254. [2019-11-21 16:21:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-21 16:21:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 267 transitions. [2019-11-21 16:21:28,810 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 267 transitions. Word has length 13 [2019-11-21 16:21:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:28,810 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 267 transitions. [2019-11-21 16:21:28,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 16:21:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 267 transitions. [2019-11-21 16:21:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 16:21:28,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:28,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:29,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:29,020 INFO L410 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash 176123619, now seen corresponding path program 1 times [2019-11-21 16:21:29,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:29,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [67965819] [2019-11-21 16:21:29,023 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-21 16:21:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:29,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:21:29,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:29,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:29,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:21:29,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:29,320 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:21:29,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:29,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-21 16:21:29,337 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-21 16:21:29,337 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:29,349 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-21 16:21:29,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67965819] [2019-11-21 16:21:29,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:29,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-21 16:21:29,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765445077] [2019-11-21 16:21:29,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:29,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:29,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:29,354 INFO L87 Difference]: Start difference. First operand 254 states and 267 transitions. Second operand 4 states. [2019-11-21 16:21:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:30,027 INFO L93 Difference]: Finished difference Result 285 states and 302 transitions. [2019-11-21 16:21:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 16:21:30,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-21 16:21:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:30,031 INFO L225 Difference]: With dead ends: 285 [2019-11-21 16:21:30,031 INFO L226 Difference]: Without dead ends: 285 [2019-11-21 16:21:30,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-21 16:21:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2019-11-21 16:21:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-21 16:21:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 265 transitions. [2019-11-21 16:21:30,041 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 265 transitions. Word has length 13 [2019-11-21 16:21:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:30,041 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 265 transitions. [2019-11-21 16:21:30,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 265 transitions. [2019-11-21 16:21:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 16:21:30,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:30,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:30,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:30,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash 176123620, now seen corresponding path program 1 times [2019-11-21 16:21:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:30,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1041389552] [2019-11-21 16:21:30,246 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-21 16:21:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:30,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:21:30,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:30,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:30,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:30,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:30,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:30,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:21:30,474 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-21 16:21:30,475 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:30,512 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-21 16:21:30,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1041389552] [2019-11-21 16:21:30,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:30,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 16:21:30,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467989398] [2019-11-21 16:21:30,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:30,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:30,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:30,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:30,518 INFO L87 Difference]: Start difference. First operand 252 states and 265 transitions. Second operand 4 states. [2019-11-21 16:21:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:31,416 INFO L93 Difference]: Finished difference Result 284 states and 300 transitions. [2019-11-21 16:21:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:21:31,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-21 16:21:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:31,421 INFO L225 Difference]: With dead ends: 284 [2019-11-21 16:21:31,421 INFO L226 Difference]: Without dead ends: 284 [2019-11-21 16:21:31,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-21 16:21:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-21 16:21:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 250. [2019-11-21 16:21:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-21 16:21:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 263 transitions. [2019-11-21 16:21:31,429 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 263 transitions. Word has length 13 [2019-11-21 16:21:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:31,430 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 263 transitions. [2019-11-21 16:21:31,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 263 transitions. [2019-11-21 16:21:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 16:21:31,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:31,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:31,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:31,634 INFO L410 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -61090836, now seen corresponding path program 1 times [2019-11-21 16:21:31,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:31,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2052692388] [2019-11-21 16:21:31,636 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-21 16:21:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:31,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:21:31,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:31,816 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:31,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2052692388] [2019-11-21 16:21:31,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:31,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 16:21:31,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826539343] [2019-11-21 16:21:31,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:31,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:31,849 INFO L87 Difference]: Start difference. First operand 250 states and 263 transitions. Second operand 4 states. [2019-11-21 16:21:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:31,970 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2019-11-21 16:21:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 16:21:31,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 16:21:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:31,973 INFO L225 Difference]: With dead ends: 288 [2019-11-21 16:21:31,973 INFO L226 Difference]: Without dead ends: 288 [2019-11-21 16:21:31,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:21:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-21 16:21:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-21 16:21:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-21 16:21:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2019-11-21 16:21:31,981 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 18 [2019-11-21 16:21:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:31,981 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2019-11-21 16:21:31,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2019-11-21 16:21:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 16:21:31,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:31,982 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] [2019-11-21 16:21:32,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:32,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash 128507730, now seen corresponding path program 1 times [2019-11-21 16:21:32,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:32,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [634811590] [2019-11-21 16:21:32,187 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-21 16:21:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:32,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:21:32,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:32,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:32,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:21:32,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:32,479 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:21:32,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:32,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-21 16:21:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:32,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:32,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [634811590] [2019-11-21 16:21:32,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:32,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-21 16:21:32,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132220156] [2019-11-21 16:21:32,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 16:21:32,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 16:21:32,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 16:21:32,554 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand 7 states. [2019-11-21 16:21:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:33,953 INFO L93 Difference]: Finished difference Result 275 states and 292 transitions. [2019-11-21 16:21:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:21:33,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-21 16:21:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:33,956 INFO L225 Difference]: With dead ends: 275 [2019-11-21 16:21:33,956 INFO L226 Difference]: Without dead ends: 275 [2019-11-21 16:21:33,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-21 16:21:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-21 16:21:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2019-11-21 16:21:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-21 16:21:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 257 transitions. [2019-11-21 16:21:33,964 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 257 transitions. Word has length 22 [2019-11-21 16:21:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:33,965 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 257 transitions. [2019-11-21 16:21:33,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 16:21:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 257 transitions. [2019-11-21 16:21:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 16:21:33,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:33,966 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] [2019-11-21 16:21:34,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:34,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash 128507731, now seen corresponding path program 1 times [2019-11-21 16:21:34,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:34,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [482009629] [2019-11-21 16:21:34,172 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-21 16:21:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:34,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 16:21:34,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:34,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:34,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:34,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:34,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:34,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:21:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:34,459 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:34,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482009629] [2019-11-21 16:21:34,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:34,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:21:34,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752547387] [2019-11-21 16:21:34,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:21:34,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:21:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:21:34,683 INFO L87 Difference]: Start difference. First operand 243 states and 257 transitions. Second operand 10 states. [2019-11-21 16:21:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:37,699 INFO L93 Difference]: Finished difference Result 304 states and 320 transitions. [2019-11-21 16:21:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:21:37,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 16:21:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:37,704 INFO L225 Difference]: With dead ends: 304 [2019-11-21 16:21:37,704 INFO L226 Difference]: Without dead ends: 304 [2019-11-21 16:21:37,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-21 16:21:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-21 16:21:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 264. [2019-11-21 16:21:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-21 16:21:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 279 transitions. [2019-11-21 16:21:37,713 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 279 transitions. Word has length 22 [2019-11-21 16:21:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:37,714 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 279 transitions. [2019-11-21 16:21:37,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:21:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 279 transitions. [2019-11-21 16:21:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-21 16:21:37,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:37,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:37,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:37,919 INFO L410 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -499657725, now seen corresponding path program 1 times [2019-11-21 16:21:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:37,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [71789725] [2019-11-21 16:21:37,921 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-21 16:21:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:38,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 16:21:38,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:38,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:38,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:38,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:21:38,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:38,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:21:38,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,243 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-21 16:21:38,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 16:21:38,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:38,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:38,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-11-21 16:21:38,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:38,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-21 16:21:38,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:38,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-11-21 16:21:38,399 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 17 treesize of output 9 [2019-11-21 16:21:38,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:38,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:38,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:38,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2019-11-21 16:21:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:38,444 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:38,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71789725] [2019-11-21 16:21:38,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:38,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2019-11-21 16:21:38,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236268269] [2019-11-21 16:21:38,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 16:21:38,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 16:21:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-21 16:21:38,560 INFO L87 Difference]: Start difference. First operand 264 states and 279 transitions. Second operand 13 states. [2019-11-21 16:21:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:40,455 INFO L93 Difference]: Finished difference Result 285 states and 301 transitions. [2019-11-21 16:21:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 16:21:40,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-21 16:21:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:40,458 INFO L225 Difference]: With dead ends: 285 [2019-11-21 16:21:40,458 INFO L226 Difference]: Without dead ends: 285 [2019-11-21 16:21:40,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-11-21 16:21:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-21 16:21:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2019-11-21 16:21:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-21 16:21:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 281 transitions. [2019-11-21 16:21:40,466 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 281 transitions. Word has length 33 [2019-11-21 16:21:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:40,467 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 281 transitions. [2019-11-21 16:21:40,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 16:21:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 281 transitions. [2019-11-21 16:21:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-21 16:21:40,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:40,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:40,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:40,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -499657724, now seen corresponding path program 1 times [2019-11-21 16:21:40,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:40,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1252923672] [2019-11-21 16:21:40,673 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-21 16:21:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:40,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 16:21:40,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:40,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:40,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:40,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:40,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:40,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:21:41,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:41,034 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 12 treesize of output 14 [2019-11-21 16:21:41,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:21:41,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-21 16:21:41,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:41,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:41,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:35 [2019-11-21 16:21:41,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:41,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-11-21 16:21:41,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:41,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 16:21:41,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2019-11-21 16:21:41,404 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 27 treesize of output 15 [2019-11-21 16:21:41,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-11-21 16:21:41,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:41,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:41,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:41,439 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:20 [2019-11-21 16:21:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:41,485 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:42,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1252923672] [2019-11-21 16:21:42,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:42,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 16:21:42,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247844489] [2019-11-21 16:21:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 16:21:42,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 16:21:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-21 16:21:42,687 INFO L87 Difference]: Start difference. First operand 265 states and 281 transitions. Second operand 16 states. [2019-11-21 16:21:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:47,701 INFO L93 Difference]: Finished difference Result 297 states and 313 transitions. [2019-11-21 16:21:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 16:21:47,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-21 16:21:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:47,704 INFO L225 Difference]: With dead ends: 297 [2019-11-21 16:21:47,704 INFO L226 Difference]: Without dead ends: 297 [2019-11-21 16:21:47,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-11-21 16:21:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-21 16:21:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 265. [2019-11-21 16:21:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-21 16:21:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 280 transitions. [2019-11-21 16:21:47,713 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 280 transitions. Word has length 33 [2019-11-21 16:21:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:47,713 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 280 transitions. [2019-11-21 16:21:47,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 16:21:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 280 transitions. [2019-11-21 16:21:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-21 16:21:47,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:47,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:47,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:47,918 INFO L410 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1593832869, now seen corresponding path program 1 times [2019-11-21 16:21:47,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:47,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1665905675] [2019-11-21 16:21:47,919 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-21 16:21:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:48,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 16:21:48,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:48,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:48,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:48,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-21 16:21:48,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 16:21:48,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 16:21:48,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-21 16:21:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:48,299 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:48,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665905675] [2019-11-21 16:21:48,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:21:48,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-21 16:21:48,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236767541] [2019-11-21 16:21:48,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 16:21:48,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 16:21:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-21 16:21:48,469 INFO L87 Difference]: Start difference. First operand 265 states and 280 transitions. Second operand 13 states. [2019-11-21 16:21:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:50,180 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2019-11-21 16:21:50,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 16:21:50,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-21 16:21:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:50,184 INFO L225 Difference]: With dead ends: 325 [2019-11-21 16:21:50,184 INFO L226 Difference]: Without dead ends: 321 [2019-11-21 16:21:50,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-21 16:21:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-21 16:21:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 295. [2019-11-21 16:21:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-21 16:21:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 311 transitions. [2019-11-21 16:21:50,193 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 311 transitions. Word has length 33 [2019-11-21 16:21:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:50,195 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 311 transitions. [2019-11-21 16:21:50,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 16:21:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 311 transitions. [2019-11-21 16:21:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-21 16:21:50,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:50,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:50,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:50,402 INFO L410 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1613735481, now seen corresponding path program 1 times [2019-11-21 16:21:50,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:50,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [896170010] [2019-11-21 16:21:50,404 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-21 16:21:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:50,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 16:21:50,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:50,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:50,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:50,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-21 16:21:50,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 16:21:50,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 16:21:50,844 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-21 16:21:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:50,877 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:50,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [896170010] [2019-11-21 16:21:50,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:21:50,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-21 16:21:50,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396330415] [2019-11-21 16:21:50,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:21:50,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:21:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:21:50,950 INFO L87 Difference]: Start difference. First operand 295 states and 311 transitions. Second operand 10 states. [2019-11-21 16:21:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:51,855 INFO L93 Difference]: Finished difference Result 353 states and 370 transitions. [2019-11-21 16:21:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:21:51,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-21 16:21:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:51,858 INFO L225 Difference]: With dead ends: 353 [2019-11-21 16:21:51,858 INFO L226 Difference]: Without dead ends: 353 [2019-11-21 16:21:51,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-21 16:21:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-21 16:21:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-11-21 16:21:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-21 16:21:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2019-11-21 16:21:51,867 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 43 [2019-11-21 16:21:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:51,867 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2019-11-21 16:21:51,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:21:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2019-11-21 16:21:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-21 16:21:51,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:51,869 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:52,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:52,072 INFO L410 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2014943713, now seen corresponding path program 2 times [2019-11-21 16:21:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:52,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1354806483] [2019-11-21 16:21:52,075 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:52,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 16:21:52,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 16:21:52,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 16:21:52,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:52,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:52,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:52,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:21:52,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:52,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:21:52,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,451 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-21 16:21:52,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 16:21:52,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:52,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:52,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-11-21 16:21:52,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:52,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-21 16:21:52,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:52,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-11-21 16:21:52,598 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 17 treesize of output 9 [2019-11-21 16:21:52,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:52,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:52,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:52,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2019-11-21 16:21:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:21:52,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:21:52,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354806483] [2019-11-21 16:21:52,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:52,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-21 16:21:52,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103736119] [2019-11-21 16:21:52,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 16:21:52,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 16:21:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-21 16:21:52,778 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand 14 states. [2019-11-21 16:21:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:54,829 INFO L93 Difference]: Finished difference Result 347 states and 377 transitions. [2019-11-21 16:21:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 16:21:54,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-11-21 16:21:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:54,832 INFO L225 Difference]: With dead ends: 347 [2019-11-21 16:21:54,833 INFO L226 Difference]: Without dead ends: 347 [2019-11-21 16:21:54,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-21 16:21:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-21 16:21:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2019-11-21 16:21:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-21 16:21:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 350 transitions. [2019-11-21 16:21:54,842 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 350 transitions. Word has length 42 [2019-11-21 16:21:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:54,843 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 350 transitions. [2019-11-21 16:21:54,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 16:21:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2019-11-21 16:21:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-21 16:21:54,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:54,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:55,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:55,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:21:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2014943714, now seen corresponding path program 1 times [2019-11-21 16:21:55,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:55,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [712133685] [2019-11-21 16:21:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:55,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 16:21:55,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:55,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:55,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:21:55,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:21:55,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:55,467 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 12 treesize of output 14 [2019-11-21 16:21:55,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:21:55,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-21 16:21:55,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:55,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:55,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:35 [2019-11-21 16:21:55,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:55,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 16:21:55,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:21:55,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-11-21 16:21:55,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2019-11-21 16:21:55,761 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 27 treesize of output 15 [2019-11-21 16:21:55,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-11-21 16:21:55,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:55,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:55,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:55,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:22 [2019-11-21 16:21:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:21:55,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:56,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:21:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:21:56,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [712133685] [2019-11-21 16:21:56,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:56,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 16:21:56,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928208383] [2019-11-21 16:21:56,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 16:21:56,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 16:21:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-21 16:21:56,891 INFO L87 Difference]: Start difference. First operand 320 states and 350 transitions. Second operand 16 states. [2019-11-21 16:22:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:01,838 INFO L93 Difference]: Finished difference Result 346 states and 376 transitions. [2019-11-21 16:22:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 16:22:01,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-11-21 16:22:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:01,840 INFO L225 Difference]: With dead ends: 346 [2019-11-21 16:22:01,841 INFO L226 Difference]: Without dead ends: 346 [2019-11-21 16:22:01,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-11-21 16:22:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-21 16:22:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 320. [2019-11-21 16:22:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-21 16:22:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 349 transitions. [2019-11-21 16:22:01,849 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 349 transitions. Word has length 42 [2019-11-21 16:22:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:01,849 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 349 transitions. [2019-11-21 16:22:01,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 16:22:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 349 transitions. [2019-11-21 16:22:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 16:22:01,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:01,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:02,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:02,054 INFO L410 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1448823109, now seen corresponding path program 1 times [2019-11-21 16:22:02,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:02,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [783535138] [2019-11-21 16:22:02,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:02,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:22:02,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:02,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:22:02,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,362 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:22:02,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:02,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-21 16:22:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:02,417 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:02,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783535138] [2019-11-21 16:22:02,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:02,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-21 16:22:02,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113562254] [2019-11-21 16:22:02,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 16:22:02,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:02,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 16:22:02,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 16:22:02,437 INFO L87 Difference]: Start difference. First operand 320 states and 349 transitions. Second operand 7 states. [2019-11-21 16:22:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:03,649 INFO L93 Difference]: Finished difference Result 332 states and 361 transitions. [2019-11-21 16:22:03,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:22:03,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-11-21 16:22:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:03,652 INFO L225 Difference]: With dead ends: 332 [2019-11-21 16:22:03,652 INFO L226 Difference]: Without dead ends: 332 [2019-11-21 16:22:03,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-21 16:22:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-21 16:22:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 317. [2019-11-21 16:22:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-21 16:22:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 343 transitions. [2019-11-21 16:22:03,660 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 343 transitions. Word has length 44 [2019-11-21 16:22:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:03,660 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 343 transitions. [2019-11-21 16:22:03,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 16:22:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 343 transitions. [2019-11-21 16:22:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 16:22:03,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:03,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:03,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:03,865 INFO L410 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1448823110, now seen corresponding path program 1 times [2019-11-21 16:22:03,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:03,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [671522065] [2019-11-21 16:22:03,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:04,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 16:22:04,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:04,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:22:04,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:04,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:04,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:04,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:22:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:04,234 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:04,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671522065] [2019-11-21 16:22:04,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:04,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-21 16:22:04,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335639262] [2019-11-21 16:22:04,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 16:22:04,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 16:22:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-21 16:22:04,421 INFO L87 Difference]: Start difference. First operand 317 states and 343 transitions. Second operand 11 states. [2019-11-21 16:22:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:07,339 INFO L93 Difference]: Finished difference Result 441 states and 472 transitions. [2019-11-21 16:22:07,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 16:22:07,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-11-21 16:22:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:07,343 INFO L225 Difference]: With dead ends: 441 [2019-11-21 16:22:07,343 INFO L226 Difference]: Without dead ends: 441 [2019-11-21 16:22:07,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-21 16:22:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-21 16:22:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 315. [2019-11-21 16:22:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-21 16:22:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 337 transitions. [2019-11-21 16:22:07,352 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 337 transitions. Word has length 44 [2019-11-21 16:22:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:07,352 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 337 transitions. [2019-11-21 16:22:07,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 16:22:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 337 transitions. [2019-11-21 16:22:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 16:22:07,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:07,354 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:07,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:07,558 INFO L410 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1219718894, now seen corresponding path program 1 times [2019-11-21 16:22:07,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:07,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [739329831] [2019-11-21 16:22:07,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:07,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 16:22:07,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:07,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:07,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:22:07,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:07,898 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:22:07,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:07,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-21 16:22:07,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:07,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 16:22:07,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:07,954 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 16:22:07,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:07,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 16:22:08,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 54 [2019-11-21 16:22:08,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,061 INFO L567 ElimStorePlain]: treesize reduction 28, result has 45.1 percent of original size [2019-11-21 16:22:08,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:08,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2019-11-21 16:22:08,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:08,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:08,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2019-11-21 16:22:08,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-21 16:22:08,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:08,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2019-11-21 16:22:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:08,386 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:08,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [739329831] [2019-11-21 16:22:08,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:22:08,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-21 16:22:08,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752083746] [2019-11-21 16:22:08,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 16:22:08,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 16:22:08,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-11-21 16:22:08,654 INFO L87 Difference]: Start difference. First operand 315 states and 337 transitions. Second operand 21 states. [2019-11-21 16:22:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:12,315 INFO L93 Difference]: Finished difference Result 358 states and 384 transitions. [2019-11-21 16:22:12,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 16:22:12,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-11-21 16:22:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:12,319 INFO L225 Difference]: With dead ends: 358 [2019-11-21 16:22:12,319 INFO L226 Difference]: Without dead ends: 358 [2019-11-21 16:22:12,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-11-21 16:22:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-21 16:22:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 320. [2019-11-21 16:22:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-21 16:22:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 343 transitions. [2019-11-21 16:22:12,328 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 343 transitions. Word has length 47 [2019-11-21 16:22:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:12,328 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 343 transitions. [2019-11-21 16:22:12,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 16:22:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 343 transitions. [2019-11-21 16:22:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 16:22:12,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:12,329 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:12,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:12,534 INFO L410 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1219718895, now seen corresponding path program 1 times [2019-11-21 16:22:12,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:12,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [539237577] [2019-11-21 16:22:12,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:12,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 16:22:12,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:12,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:22:12,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:12,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:12,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:22:12,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:12,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:12,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:12,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 16:22:12,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:12,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:22:12,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,005 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-21 16:22:13,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:13,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-21 16:22:13,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 54 [2019-11-21 16:22:13,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,126 INFO L567 ElimStorePlain]: treesize reduction 28, result has 48.1 percent of original size [2019-11-21 16:22:13,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:13,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:26 [2019-11-21 16:22:13,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:13,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:13,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:13,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:48 [2019-11-21 16:22:13,460 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 27 treesize of output 15 [2019-11-21 16:22:13,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 16:22:13,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:13,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:13,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:13,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:27 [2019-11-21 16:22:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:13,602 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:14,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:15,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [539237577] [2019-11-21 16:22:15,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:22:15,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-21 16:22:15,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155457075] [2019-11-21 16:22:15,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 16:22:15,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 16:22:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-11-21 16:22:15,036 INFO L87 Difference]: Start difference. First operand 320 states and 343 transitions. Second operand 22 states. [2019-11-21 16:22:17,508 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-21 16:22:20,054 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 16:22:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:25,686 INFO L93 Difference]: Finished difference Result 412 states and 437 transitions. [2019-11-21 16:22:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 16:22:25,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-21 16:22:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:25,689 INFO L225 Difference]: With dead ends: 412 [2019-11-21 16:22:25,689 INFO L226 Difference]: Without dead ends: 412 [2019-11-21 16:22:25,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2019-11-21 16:22:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-21 16:22:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 339. [2019-11-21 16:22:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-11-21 16:22:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 362 transitions. [2019-11-21 16:22:25,699 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 362 transitions. Word has length 47 [2019-11-21 16:22:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:25,699 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 362 transitions. [2019-11-21 16:22:25,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 16:22:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 362 transitions. [2019-11-21 16:22:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-21 16:22:25,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:25,701 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:25,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:25,905 INFO L410 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1439097603, now seen corresponding path program 2 times [2019-11-21 16:22:25,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:25,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1361950613] [2019-11-21 16:22:25,907 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:26,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-21 16:22:26,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 16:22:26,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 16:22:26,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:26,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-21 16:22:26,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:26,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:26,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-21 16:22:26,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:26,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:26,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:26,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-11-21 16:22:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-21 16:22:26,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:28,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:32,696 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 30 treesize of output 24 [2019-11-21 16:22:32,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:32,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:32,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2019-11-21 16:22:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:32,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:38,821 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-21 16:22:38,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:38,827 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 22 treesize of output 16 [2019-11-21 16:22:38,828 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-21 16:22:38,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:22:38,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-11-21 16:22:38,833 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:38,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:38,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 16:22:38,839 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:11 [2019-11-21 16:22:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-21 16:22:38,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361950613] [2019-11-21 16:22:38,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:38,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-21 16:22:38,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319292556] [2019-11-21 16:22:38,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 16:22:38,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 16:22:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:22:38,850 INFO L87 Difference]: Start difference. First operand 339 states and 362 transitions. Second operand 8 states. [2019-11-21 16:22:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:39,990 INFO L93 Difference]: Finished difference Result 366 states and 390 transitions. [2019-11-21 16:22:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 16:22:39,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-21 16:22:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:39,995 INFO L225 Difference]: With dead ends: 366 [2019-11-21 16:22:39,995 INFO L226 Difference]: Without dead ends: 366 [2019-11-21 16:22:39,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-21 16:22:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-21 16:22:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 343. [2019-11-21 16:22:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-21 16:22:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 366 transitions. [2019-11-21 16:22:40,004 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 366 transitions. Word has length 52 [2019-11-21 16:22:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:40,004 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 366 transitions. [2019-11-21 16:22:40,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 16:22:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 366 transitions. [2019-11-21 16:22:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-21 16:22:40,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:40,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:40,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:40,207 INFO L410 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:40,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1919135098, now seen corresponding path program 1 times [2019-11-21 16:22:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2053653796] [2019-11-21 16:22:40,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:40,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 16:22:40,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:40,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:40,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:40,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-21 16:22:40,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-21 16:22:40,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:40,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 16:22:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:40,686 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:40,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:40,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2019-11-21 16:22:40,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:40,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:40,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:40,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-11-21 16:22:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:22:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2053653796] [2019-11-21 16:22:40,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:40,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 15 [2019-11-21 16:22:40,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338204027] [2019-11-21 16:22:40,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 16:22:40,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:40,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 16:22:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-11-21 16:22:40,864 INFO L87 Difference]: Start difference. First operand 343 states and 366 transitions. Second operand 16 states. [2019-11-21 16:22:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:43,624 INFO L93 Difference]: Finished difference Result 377 states and 400 transitions. [2019-11-21 16:22:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 16:22:43,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-21 16:22:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:43,628 INFO L225 Difference]: With dead ends: 377 [2019-11-21 16:22:43,629 INFO L226 Difference]: Without dead ends: 377 [2019-11-21 16:22:43,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-21 16:22:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-21 16:22:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 364. [2019-11-21 16:22:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-21 16:22:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 391 transitions. [2019-11-21 16:22:43,637 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 391 transitions. Word has length 53 [2019-11-21 16:22:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:43,638 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 391 transitions. [2019-11-21 16:22:43,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 16:22:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 391 transitions. [2019-11-21 16:22:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-21 16:22:43,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:43,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:43,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:43,843 INFO L410 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1919135097, now seen corresponding path program 1 times [2019-11-21 16:22:43,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:43,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1453564669] [2019-11-21 16:22:43,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:44,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 16:22:44,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:44,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:44,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:44,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:44,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:44,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-11-21 16:22:44,517 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 23 treesize of output 15 [2019-11-21 16:22:44,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:44,542 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 39 treesize of output 19 [2019-11-21 16:22:44,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:44,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:44,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:16 [2019-11-21 16:22:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:44,719 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:45,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:45,346 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 26 treesize of output 24 [2019-11-21 16:22:45,347 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-21 16:22:45,364 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 32 treesize of output 30 [2019-11-21 16:22:45,365 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:45,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:45,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2019-11-21 16:22:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:45,388 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:45,493 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 16:22:45,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:45,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:45,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 16:22:45,495 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:93 [2019-11-21 16:22:45,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:45,891 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-21 16:22:45,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:46,392 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-21 16:22:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:22:46,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453564669] [2019-11-21 16:22:46,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:46,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 16 [2019-11-21 16:22:46,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657112602] [2019-11-21 16:22:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-21 16:22:46,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-21 16:22:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-11-21 16:22:46,429 INFO L87 Difference]: Start difference. First operand 364 states and 391 transitions. Second operand 17 states. [2019-11-21 16:22:48,983 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 16:22:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:52,904 INFO L93 Difference]: Finished difference Result 386 states and 407 transitions. [2019-11-21 16:22:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 16:22:52,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-11-21 16:22:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:52,907 INFO L225 Difference]: With dead ends: 386 [2019-11-21 16:22:52,907 INFO L226 Difference]: Without dead ends: 386 [2019-11-21 16:22:52,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-11-21 16:22:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-21 16:22:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 362. [2019-11-21 16:22:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-11-21 16:22:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 384 transitions. [2019-11-21 16:22:52,915 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 384 transitions. Word has length 53 [2019-11-21 16:22:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:52,915 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 384 transitions. [2019-11-21 16:22:52,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-21 16:22:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 384 transitions. [2019-11-21 16:22:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 16:22:52,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:52,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:53,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:53,120 INFO L410 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -353390308, now seen corresponding path program 1 times [2019-11-21 16:22:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:53,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978406759] [2019-11-21 16:22:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:53,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 16:22:53,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:53,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:53,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:53,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:53,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:53,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:53,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-11-21 16:22:53,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2019-11-21 16:22:53,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:53,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:53,736 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-21 16:22:53,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2019-11-21 16:22:53,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:53,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:53,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:53,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:7 [2019-11-21 16:22:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:53,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:22:54,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978406759] [2019-11-21 16:22:54,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:54,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 12] imperfect sequences [] total 22 [2019-11-21 16:22:54,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394104249] [2019-11-21 16:22:54,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 16:22:54,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 16:22:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-11-21 16:22:54,357 INFO L87 Difference]: Start difference. First operand 362 states and 384 transitions. Second operand 22 states. [2019-11-21 16:22:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:57,937 INFO L93 Difference]: Finished difference Result 381 states and 401 transitions. [2019-11-21 16:22:57,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 16:22:57,939 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-11-21 16:22:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:57,941 INFO L225 Difference]: With dead ends: 381 [2019-11-21 16:22:57,941 INFO L226 Difference]: Without dead ends: 381 [2019-11-21 16:22:57,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2019-11-21 16:22:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-21 16:22:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 359. [2019-11-21 16:22:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-21 16:22:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 378 transitions. [2019-11-21 16:22:57,950 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 378 transitions. Word has length 57 [2019-11-21 16:22:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:57,950 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 378 transitions. [2019-11-21 16:22:57,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 16:22:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 378 transitions. [2019-11-21 16:22:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-21 16:22:57,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:57,952 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:58,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:58,156 INFO L410 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-21 16:22:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1653517031, now seen corresponding path program 1 times [2019-11-21 16:22:58,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1163258383] [2019-11-21 16:22:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:58,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-21 16:22:58,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:58,606 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 16:22:58,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-11-21 16:22:58,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:22:58,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-21 16:22:58,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:22:58,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-21 16:22:58,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-21 16:22:58,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:22:58,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-21 16:22:58,748 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_129|], 2=[|v_#memory_$Pointer$.base_139|]} [2019-11-21 16:22:58,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:22:58,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-21 16:22:58,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2019-11-21 16:22:58,844 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_130|], 6=[|v_#memory_$Pointer$.base_140|]} [2019-11-21 16:22:58,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:22:58,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 16:22:58,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:22:58,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:58,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2019-11-21 16:22:58,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,950 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-21 16:22:58,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:58,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:51 [2019-11-21 16:22:59,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 16:22:59,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:59,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 45 [2019-11-21 16:22:59,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:59,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:59,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:59,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:26 [2019-11-21 16:22:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:59,271 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:59,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 45 treesize of output 43 [2019-11-21 16:22:59,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-21 16:22:59,520 INFO L567 ElimStorePlain]: treesize reduction 47, result has 41.3 percent of original size [2019-11-21 16:22:59,520 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:59,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:59,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:59,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-11-21 16:22:59,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:59,863 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 16:22:59,869 INFO L168 Benchmark]: Toolchain (without parser) took 98131.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -370.1 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:59,870 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:22:59,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:59,871 INFO L168 Benchmark]: Boogie Preprocessor took 102.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:59,871 INFO L168 Benchmark]: RCFGBuilder took 1572.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2019-11-21 16:22:59,871 INFO L168 Benchmark]: TraceAbstraction took 95648.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.7 MB). Free memory was 987.0 MB in the beginning and 1.3 GB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:22:59,873 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 804.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1572.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95648.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.7 MB). Free memory was 987.0 MB in the beginning and 1.3 GB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...