./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 10:14:09,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:14:09,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:14:09,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:14:09,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:14:09,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:14:09,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:14:09,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:14:09,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:14:09,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:14:09,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:14:09,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:14:09,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:14:09,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:14:09,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:14:09,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:14:09,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:14:09,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:14:09,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:14:09,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:14:09,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:14:09,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:14:09,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:14:09,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:14:09,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:14:09,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:14:09,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:14:09,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:14:09,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:14:09,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:14:09,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:14:09,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:14:09,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:14:09,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:14:09,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:14:09,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:14:09,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:14:09,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:14:09,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:14:09,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:14:09,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:14:09,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 10:14:09,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:14:09,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:14:09,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:14:09,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:14:09,630 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:14:09,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:14:09,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:14:09,631 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:14:09,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:14:09,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:14:09,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:14:09,632 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:14:09,632 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:14:09,633 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 10:14:09,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:14:09,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:14:09,634 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:14:09,634 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:14:09,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:14:09,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:14:09,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:14:09,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:14:09,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:14:09,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:14:09,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:14:09,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:14:09,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:14:09,637 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:14:09,637 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:14:09,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:14:09,638 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 10:14:09,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:14:09,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:14:09,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:14:09,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:14:09,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:14:09,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 10:14:10,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eebab5370/4191a003524c4228b9fd9d1d70d47058/FLAG01fb22c19 [2019-11-22 10:14:10,528 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:14:10,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 10:14:10,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eebab5370/4191a003524c4228b9fd9d1d70d47058/FLAG01fb22c19 [2019-11-22 10:14:10,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eebab5370/4191a003524c4228b9fd9d1d70d47058 [2019-11-22 10:14:10,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:14:10,869 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:14:10,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:14:10,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:14:10,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:14:10,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:10" (1/1) ... [2019-11-22 10:14:10,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3403e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:10, skipping insertion in model container [2019-11-22 10:14:10,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:10" (1/1) ... [2019-11-22 10:14:10,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:14:10,939 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:14:11,351 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-22 10:14:11,351 INFO L968 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-22 10:14:11,352 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-22 10:14:11,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:14:11,385 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 10:14:11,392 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:14:11,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:14:11,439 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:14:11,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:14:11,571 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:14:11,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11 WrapperNode [2019-11-22 10:14:11,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:14:11,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:14:11,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:14:11,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:14:11,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2019-11-22 10:14:11,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:14:11,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:14:11,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:14:11,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:14:11,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:14:11,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:14:11,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:14:11,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:14:11,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:14:11,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:14:11,714 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 10:14:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 10:14:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 10:14:11,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:14:11,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 10:14:11,716 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:14:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:14:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:14:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:14:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:14:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:14:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:14:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:14:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:14:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:14:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:14:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:14:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:14:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:14:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:14:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:14:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:14:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:14:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:14:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:14:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:14:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:14:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:14:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:14:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:14:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:14:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:14:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:14:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:14:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:14:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:14:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:14:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:14:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:14:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:14:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:14:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:14:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 10:14:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:14:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:14:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:14:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:14:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:14:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:14:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:14:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:14:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:14:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:14:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:14:11,730 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:14:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:14:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:14:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:14:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:14:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:14:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:14:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:14:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:14:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:14:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:14:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:14:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:14:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:14:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:14:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:14:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:14:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:14:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:14:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:14:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:14:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:14:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:14:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:14:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:14:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:14:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:14:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:14:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:14:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:14:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:14:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:14:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:14:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:14:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:14:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:14:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:14:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 10:14:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 10:14:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:14:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:14:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:14:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 10:14:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 10:14:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:14:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 10:14:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:14:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 10:14:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 10:14:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:14:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:14:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:14:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 10:14:12,743 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:14:12,743 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 10:14:12,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:12 BoogieIcfgContainer [2019-11-22 10:14:12,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:14:12,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:14:12,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:14:12,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:14:12,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:14:10" (1/3) ... [2019-11-22 10:14:12,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:12, skipping insertion in model container [2019-11-22 10:14:12,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (2/3) ... [2019-11-22 10:14:12,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:12, skipping insertion in model container [2019-11-22 10:14:12,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:12" (3/3) ... [2019-11-22 10:14:12,755 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-22 10:14:12,765 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:14:12,774 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-22 10:14:12,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-22 10:14:12,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:14:12,806 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:14:12,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:14:12,807 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:14:12,807 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:14:12,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:14:12,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:14:12,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:14:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-22 10:14:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 10:14:12,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:12,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:12,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-22 10:14:12,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:12,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1348281198] [2019-11-22 10:14:12,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:13,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 10:14:13,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:13,118 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:13,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348281198] [2019-11-22 10:14:13,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:13,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:14:13,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141258377] [2019-11-22 10:14:13,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 10:14:13,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 10:14:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 10:14:13,169 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-22 10:14:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:13,206 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-22 10:14:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 10:14:13,208 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 10:14:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:13,226 INFO L225 Difference]: With dead ends: 110 [2019-11-22 10:14:13,227 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 10:14:13,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-22 10:14:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 10:14:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 10:14:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 10:14:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-22 10:14:13,290 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-22 10:14:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:13,290 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-22 10:14:13,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 10:14:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-22 10:14:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:14:13,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:13,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:13,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:13,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-22 10:14:13,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:13,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [934096784] [2019-11-22 10:14:13,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:13,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 10:14:13,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:13,756 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-22 10:14:13,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:14:13,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:13,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 10:14:13,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:13,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:13,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:13,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 10:14:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:13,899 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:14,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934096784] [2019-11-22 10:14:14,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:14,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:14:14,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456304584] [2019-11-22 10:14:14,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:14:14,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:14:14,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:14:14,023 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-11-22 10:14:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:15,191 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-22 10:14:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 10:14:15,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 10:14:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:15,199 INFO L225 Difference]: With dead ends: 119 [2019-11-22 10:14:15,199 INFO L226 Difference]: Without dead ends: 119 [2019-11-22 10:14:15,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:14:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-22 10:14:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2019-11-22 10:14:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 10:14:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-22 10:14:15,218 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 9 [2019-11-22 10:14:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:15,218 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-22 10:14:15,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:14:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-22 10:14:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:14:15,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:15,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:15,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:15,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-22 10:14:15,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:15,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [104277507] [2019-11-22 10:14:15,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:15,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:14:15,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:15,662 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-22 10:14:15,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:15,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:15,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:15,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 10:14:15,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:15,736 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-22 10:14:15,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:15,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:15,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:15,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:22 [2019-11-22 10:14:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:15,790 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:15,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:16,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [104277507] [2019-11-22 10:14:16,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:16,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:14:16,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594804382] [2019-11-22 10:14:16,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:14:16,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:14:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:14:16,075 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 8 states. [2019-11-22 10:14:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:17,280 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-22 10:14:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:14:17,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 10:14:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:17,283 INFO L225 Difference]: With dead ends: 115 [2019-11-22 10:14:17,283 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 10:14:17,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:14:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 10:14:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-11-22 10:14:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 10:14:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-22 10:14:17,297 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 9 [2019-11-22 10:14:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:17,297 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-22 10:14:17,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:14:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-22 10:14:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:14:17,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:17,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:17,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:17,500 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-22 10:14:17,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:17,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [496380937] [2019-11-22 10:14:17,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:17,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:14:17,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:17,721 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-22 10:14:17,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:17,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:17,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:17,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:14:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:17,740 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:17,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [496380937] [2019-11-22 10:14:17,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:17,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 10:14:17,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702731112] [2019-11-22 10:14:17,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:17,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:17,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:17,769 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2019-11-22 10:14:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:18,019 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-11-22 10:14:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:18,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:14:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:18,021 INFO L225 Difference]: With dead ends: 109 [2019-11-22 10:14:18,022 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 10:14:18,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-22 10:14:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 10:14:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-22 10:14:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 10:14:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-22 10:14:18,031 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 10 [2019-11-22 10:14:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:18,031 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-22 10:14:18,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-22 10:14:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:14:18,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:18,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:18,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:18,236 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-22 10:14:18,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:18,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1347578136] [2019-11-22 10:14:18,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:18,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:18,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:18,447 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-22 10:14:18,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:18,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:18,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:18,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:14:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:18,472 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:18,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1347578136] [2019-11-22 10:14:18,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:18,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:14:18,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774024071] [2019-11-22 10:14:18,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:18,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:18,523 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-22 10:14:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:18,793 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-11-22 10:14:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:18,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:14:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:18,795 INFO L225 Difference]: With dead ends: 108 [2019-11-22 10:14:18,795 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 10:14:18,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 10:14:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-22 10:14:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-22 10:14:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-22 10:14:18,804 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 10 [2019-11-22 10:14:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:18,804 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-22 10:14:18,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-22 10:14:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 10:14:18,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:18,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:19,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-22 10:14:19,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [764310176] [2019-11-22 10:14:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:19,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:14:19,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:19,238 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-22 10:14:19,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:19,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:19,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:19,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:14:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,249 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [764310176] [2019-11-22 10:14:19,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:19,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:14:19,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412546411] [2019-11-22 10:14:19,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:14:19,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:14:19,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:19,263 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2019-11-22 10:14:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:19,467 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-22 10:14:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:14:19,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-22 10:14:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:19,469 INFO L225 Difference]: With dead ends: 106 [2019-11-22 10:14:19,469 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 10:14:19,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:14:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 10:14:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-22 10:14:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 10:14:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 10:14:19,478 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 15 [2019-11-22 10:14:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:19,478 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 10:14:19,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:14:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 10:14:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 10:14:19,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:19,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:19,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-22 10:14:19,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:19,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [655643698] [2019-11-22 10:14:19,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:19,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:19,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:19,902 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-22 10:14:19,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:19,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:19,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:19,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:14:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,916 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:19,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [655643698] [2019-11-22 10:14:19,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:19,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:14:19,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807595476] [2019-11-22 10:14:19,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:19,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:19,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:19,977 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 4 states. [2019-11-22 10:14:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:20,301 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 10:14:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:20,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 10:14:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:20,304 INFO L225 Difference]: With dead ends: 107 [2019-11-22 10:14:20,304 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 10:14:20,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 10:14:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-11-22 10:14:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 10:14:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 10:14:20,311 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 15 [2019-11-22 10:14:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:20,312 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 10:14:20,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 10:14:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 10:14:20,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:20,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:20,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,517 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-22 10:14:20,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:20,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [410851898] [2019-11-22 10:14:20,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:20,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:14:20,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:20,711 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-22 10:14:20,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:20,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:20,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:20,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:14:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:20,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [410851898] [2019-11-22 10:14:20,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:20,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-22 10:14:20,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275046107] [2019-11-22 10:14:20,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:14:20,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:20,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:14:20,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:14:20,809 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 6 states. [2019-11-22 10:14:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:21,311 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-22 10:14:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:21,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 10:14:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:21,312 INFO L225 Difference]: With dead ends: 140 [2019-11-22 10:14:21,312 INFO L226 Difference]: Without dead ends: 140 [2019-11-22 10:14:21,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:14:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-22 10:14:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2019-11-22 10:14:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 10:14:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-22 10:14:21,320 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2019-11-22 10:14:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:21,321 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-22 10:14:21,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:14:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-22 10:14:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 10:14:21,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:21,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:21,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:21,525 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-22 10:14:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:21,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1270364586] [2019-11-22 10:14:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:21,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:14:21,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:21,735 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-22 10:14:21,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:21,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:21,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:21,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:14:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:21,765 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1270364586] [2019-11-22 10:14:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:14:21,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089315503] [2019-11-22 10:14:21,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:14:21,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:14:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:14:21,884 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 6 states. [2019-11-22 10:14:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:22,544 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-11-22 10:14:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:22,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 10:14:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:22,547 INFO L225 Difference]: With dead ends: 110 [2019-11-22 10:14:22,547 INFO L226 Difference]: Without dead ends: 110 [2019-11-22 10:14:22,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:14:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-22 10:14:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-22 10:14:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 10:14:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 10:14:22,559 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 16 [2019-11-22 10:14:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:22,559 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 10:14:22,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:14:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 10:14:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:14:22,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:22,561 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-22 10:14:22,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:22,768 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-22 10:14:22,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:22,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [339395695] [2019-11-22 10:14:22,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:22,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:22,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:23,029 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [339395695] [2019-11-22 10:14:23,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:23,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 10:14:23,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480741620] [2019-11-22 10:14:23,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:14:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:14:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:14:23,111 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2019-11-22 10:14:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:23,795 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 10:14:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:23,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 10:14:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:23,799 INFO L225 Difference]: With dead ends: 107 [2019-11-22 10:14:23,799 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 10:14:23,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:14:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 10:14:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-22 10:14:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-22 10:14:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-22 10:14:23,805 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 18 [2019-11-22 10:14:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:23,805 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-22 10:14:23,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:14:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-22 10:14:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:14:23,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:23,807 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-22 10:14:24,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:24,008 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-22 10:14:24,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:24,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [184484371] [2019-11-22 10:14:24,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:24,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:14:24,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:24,220 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:24,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184484371] [2019-11-22 10:14:24,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:24,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 10:14:24,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056430932] [2019-11-22 10:14:24,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:14:24,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:14:24,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:14:24,270 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2019-11-22 10:14:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:24,732 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-22 10:14:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:24,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 10:14:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:24,734 INFO L225 Difference]: With dead ends: 142 [2019-11-22 10:14:24,734 INFO L226 Difference]: Without dead ends: 142 [2019-11-22 10:14:24,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:14:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-22 10:14:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-11-22 10:14:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-22 10:14:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-22 10:14:24,740 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 18 [2019-11-22 10:14:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:24,740 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-22 10:14:24,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:14:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-22 10:14:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:14:24,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:24,742 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-22 10:14:24,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:24,945 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-22 10:14:24,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:24,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1869884476] [2019-11-22 10:14:24,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:25,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 10:14:25,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:25,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:25,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1869884476] [2019-11-22 10:14:25,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:25,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 10:14:25,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908648042] [2019-11-22 10:14:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:25,188 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 4 states. [2019-11-22 10:14:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:25,250 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-22 10:14:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:25,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 10:14:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:25,252 INFO L225 Difference]: With dead ends: 113 [2019-11-22 10:14:25,252 INFO L226 Difference]: Without dead ends: 113 [2019-11-22 10:14:25,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-22 10:14:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-22 10:14:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 10:14:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-11-22 10:14:25,256 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 18 [2019-11-22 10:14:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:25,257 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-11-22 10:14:25,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-11-22 10:14:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:14:25,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:25,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:25,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:25,462 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-22 10:14:25,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:25,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1569960532] [2019-11-22 10:14:25,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:25,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:14:25,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:25,835 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-22 10:14:25,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:25,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:25,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:25,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:14:25,865 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-22 10:14:25,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:25,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:25,894 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-22 10:14:25,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:25,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:25,913 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-22 10:14:25,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-22 10:14:25,987 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 11 [2019-11-22 10:14:25,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:26,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:26,014 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-22 10:14:26,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:26,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:26,026 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-22 10:14:26,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-22 10:14:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:26,058 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:26,218 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-11-22 10:14:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:26,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1569960532] [2019-11-22 10:14:26,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:26,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:14:26,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010773691] [2019-11-22 10:14:26,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:14:26,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:26,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:14:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:14:26,440 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2019-11-22 10:14:27,286 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-22 10:14:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:28,243 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-22 10:14:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:14:28,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 10:14:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:28,245 INFO L225 Difference]: With dead ends: 120 [2019-11-22 10:14:28,246 INFO L226 Difference]: Without dead ends: 120 [2019-11-22 10:14:28,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-22 10:14:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-22 10:14:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2019-11-22 10:14:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-22 10:14:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-11-22 10:14:28,251 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 19 [2019-11-22 10:14:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:28,251 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-11-22 10:14:28,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:14:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-11-22 10:14:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:14:28,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:28,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:28,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:28,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-22 10:14:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:28,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [697073092] [2019-11-22 10:14:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:28,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:28,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:28,684 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-22 10:14:28,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:28,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:28,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:28,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:14:28,695 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-22 10:14:28,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:28,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:28,706 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-22 10:14:28,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-22 10:14:28,721 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 11 [2019-11-22 10:14:28,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:28,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:28,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:28,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-22 10:14:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:28,744 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:28,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697073092] [2019-11-22 10:14:28,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:28,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:14:28,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144416721] [2019-11-22 10:14:28,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:14:28,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:28,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:14:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:14:28,760 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 5 states. [2019-11-22 10:14:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:29,149 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-22 10:14:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:29,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 10:14:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:29,151 INFO L225 Difference]: With dead ends: 115 [2019-11-22 10:14:29,152 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 10:14:29,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:14:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 10:14:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-11-22 10:14:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-22 10:14:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-22 10:14:29,159 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 19 [2019-11-22 10:14:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:29,159 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-22 10:14:29,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:14:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-22 10:14:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 10:14:29,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:29,161 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] [2019-11-22 10:14:29,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:29,362 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:14:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-22 10:14:29,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:29,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2030566513] [2019-11-22 10:14:29,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-22 10:14:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:29,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:14:29,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:29,598 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-22 10:14:29,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:29,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:29,614 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-22 10:14:29,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:29,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:29,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:29,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-22 10:14:29,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:29,711 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-22 10:14:29,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:29,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:29,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:29,740 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-22 10:14:29,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:29,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:29,755 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-22 10:14:29,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-22 10:14:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:29,776 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:29,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:33,118 WARN L192 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-22 10:14:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:35,597 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-22 10:14:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:14:35,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030566513] [2019-11-22 10:14:35,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:35,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:14:35,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608657554] [2019-11-22 10:14:35,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:14:35,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:14:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-22 10:14:35,796 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-22 10:14:47,250 WARN L192 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-22 10:14:57,579 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-22 10:15:13,792 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 10:16:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:16:06,024 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-11-22 10:16:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 10:16:06,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 10:16:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:16:06,034 INFO L225 Difference]: With dead ends: 130 [2019-11-22 10:16:06,035 INFO L226 Difference]: Without dead ends: 130 [2019-11-22 10:16:06,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=57, Invalid=147, Unknown=6, NotChecked=0, Total=210 [2019-11-22 10:16:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-22 10:16:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2019-11-22 10:16:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 10:16:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-22 10:16:06,040 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 20 [2019-11-22 10:16:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:16:06,040 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-22 10:16:06,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:16:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-22 10:16:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 10:16:06,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:16:06,042 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-22 10:16:06,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:16:06,248 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:16:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:16:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-22 10:16:06,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:16:06,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [814239626] [2019-11-22 10:16:06,250 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-22 10:16:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:16:06,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:16:06,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:16:06,486 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 5 treesize of output 3 [2019-11-22 10:16:06,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:06,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-22 10:16:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:06,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:16:06,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:06,562 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 12 treesize of output 16 [2019-11-22 10:16:06,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:06,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:06,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-22 10:16:06,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2019-11-22 10:16:06,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:06,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:16:06,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-22 10:16:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:06,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [814239626] [2019-11-22 10:16:06,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:16:06,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:16:06,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574817886] [2019-11-22 10:16:06,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:16:06,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:16:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:16:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:16:06,583 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2019-11-22 10:16:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:16:06,873 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 10:16:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:16:06,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 10:16:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:16:06,875 INFO L225 Difference]: With dead ends: 107 [2019-11-22 10:16:06,875 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 10:16:06,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:16:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 10:16:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 10:16:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 10:16:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-22 10:16:06,880 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-22 10:16:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:16:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-22 10:16:06,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:16:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-22 10:16:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 10:16:06,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:16:06,882 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-22 10:16:07,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:16:07,084 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:16:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:16:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-22 10:16:07,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:16:07,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [302251190] [2019-11-22 10:16:07,085 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-22 10:16:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:16:07,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:16:07,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:16:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:07,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:16:07,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,455 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 8 treesize of output 6 [2019-11-22 10:16:07,456 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:07,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:07,472 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-22 10:16:07,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-22 10:16:07,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:07,593 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 16 treesize of output 20 [2019-11-22 10:16:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:07,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:07,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:07,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-11-22 10:16:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:07,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:08,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:08,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:08,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [302251190] [2019-11-22 10:16:08,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:16:08,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:16:08,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963930355] [2019-11-22 10:16:08,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:16:08,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:16:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:16:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:16:08,535 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 10 states. [2019-11-22 10:16:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:16:08,947 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-11-22 10:16:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:16:08,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 10:16:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:16:08,949 INFO L225 Difference]: With dead ends: 102 [2019-11-22 10:16:08,949 INFO L226 Difference]: Without dead ends: 102 [2019-11-22 10:16:08,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:16:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-22 10:16:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-22 10:16:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 10:16:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 10:16:08,954 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2019-11-22 10:16:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:16:08,955 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 10:16:08,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:16:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 10:16:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 10:16:08,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:16:08,956 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-22 10:16:09,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:16:09,159 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:16:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:16:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-22 10:16:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:16:09,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1761868240] [2019-11-22 10:16:09,161 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-22 10:16:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:16:09,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 10:16:09,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:16:09,423 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-22 10:16:09,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:09,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:09,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:16:09,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:16:09,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:16:09,473 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-22 10:16:09,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:09,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:09,490 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-22 10:16:09,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2019-11-22 10:16:09,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:16:09,584 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 0 case distinctions, treesize of input 22 treesize of output 16 [2019-11-22 10:16:09,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:09,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:09,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:09,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-22 10:16:09,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:16:09,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:16:09,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:09,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 43 [2019-11-22 10:16:09,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:09,883 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-22 10:16:09,883 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.1 percent of original size [2019-11-22 10:16:09,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:09,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:40 [2019-11-22 10:16:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:10,333 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:16:10,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:10,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:10,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:10,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:13,533 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-22 10:16:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:16,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:17,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1761868240] [2019-11-22 10:16:17,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:16:17,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-22 10:16:17,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367488120] [2019-11-22 10:16:17,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 10:16:17,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:16:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 10:16:17,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-11-22 10:16:17,266 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 16 states. [2019-11-22 10:16:58,790 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-11-22 10:19:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:19:22,389 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-22 10:19:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 10:19:22,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-22 10:19:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:19:22,392 INFO L225 Difference]: With dead ends: 183 [2019-11-22 10:19:22,392 INFO L226 Difference]: Without dead ends: 183 [2019-11-22 10:19:22,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2019-11-22 10:19:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-22 10:19:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 143. [2019-11-22 10:19:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-22 10:19:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-11-22 10:19:22,400 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 22 [2019-11-22 10:19:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:19:22,400 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-11-22 10:19:22,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 10:19:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-11-22 10:19:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 10:19:22,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:19:22,401 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:19:22,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:19:22,602 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-22 10:19:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:19:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-22 10:19:22,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:19:22,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1018971181] [2019-11-22 10:19:22,604 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-22 10:19:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:19:22,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 10:19:22,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:19:22,862 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-22 10:19:22,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:19:22,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:19:22,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:19:22,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 10:19:22,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 10:19:22,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:19:22,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:19:22,925 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-22 10:19:22,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-11-22 10:19:23,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:19:23,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 10:19:23,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:19:23,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:19:23,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:19:23,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2019-11-22 10:19:23,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:19:23,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:19:23,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:19:23,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-22 10:19:23,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:19:23,407 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-22 10:19:23,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:19:23,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:30 [2019-11-22 10:19:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:19:23,469 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:19:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:19:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:19:24,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:19:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:19:24,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:19:24,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 10:19:27,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:19:27,013 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 10:19:27,019 INFO L168 Benchmark]: Toolchain (without parser) took 316150.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.9 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -296.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:19:27,020 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:19:27,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-22 10:19:27,021 INFO L168 Benchmark]: Boogie Preprocessor took 83.50 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-22 10:19:27,021 INFO L168 Benchmark]: RCFGBuilder took 1088.19 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: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-11-22 10:19:27,022 INFO L168 Benchmark]: TraceAbstraction took 314271.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:19:27,024 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 702.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.50 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 1088.19 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: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 314271.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...