./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 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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 09:44:54,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:44:54,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:44:54,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:44:54,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:44:54,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:44:54,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:44:54,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:44:54,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:44:54,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:44:54,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:44:54,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:44:54,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:44:54,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:44:54,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:44:54,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:44:54,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:44:54,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:44:54,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:44:54,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:44:54,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:44:54,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:44:54,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:44:54,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:44:54,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:44:54,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:44:54,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:44:54,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:44:54,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:44:54,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:44:54,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:44:54,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:44:54,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:44:54,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:44:54,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:44:54,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:44:54,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:44:54,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:44:54,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:44:54,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:44:54,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:44:54,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 09:44:54,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:44:54,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:44:54,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:44:54,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:44:54,077 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:44:54,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:44:54,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:44:54,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:44:54,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:44:54,078 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:44:54,079 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:44:54,079 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 09:44:54,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:44:54,080 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:44:54,080 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:44:54,080 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:44:54,081 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:44:54,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:44:54,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:44:54,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:44:54,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:44:54,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:44:54,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:44:54,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:44:54,083 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:44:54,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:44:54,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:44:54,083 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 09:44:54,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:44:54,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:44:54,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:44:54,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:44:54,411 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:44:54,412 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 09:44:54,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151269a0/8ec314e737d749d8ae35d220eef05c9d/FLAGef8b2bfa6 [2019-11-22 09:44:55,037 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:44:55,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 09:44:55,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151269a0/8ec314e737d749d8ae35d220eef05c9d/FLAGef8b2bfa6 [2019-11-22 09:44:55,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151269a0/8ec314e737d749d8ae35d220eef05c9d [2019-11-22 09:44:55,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:44:55,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:44:55,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:44:55,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:44:55,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:44:55,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:55" (1/1) ... [2019-11-22 09:44:55,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:55, skipping insertion in model container [2019-11-22 09:44:55,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:55" (1/1) ... [2019-11-22 09:44:55,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:44:55,377 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:44:55,794 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 09:44:55,795 INFO L968 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-22 09:44:55,795 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-22 09:44:55,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:55,840 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 09:44:55,853 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:44:55,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:55,919 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:44:55,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:56,028 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:44:56,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56 WrapperNode [2019-11-22 09:44:56,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:44:56,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:44:56,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:44:56,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:44:56,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... [2019-11-22 09:44:56,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:44:56,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:44:56,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:44:56,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:44:56,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:44:56,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 09:44:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 09:44:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 09:44:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:44:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 09:44:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:44:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:44:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:44:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:44:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:44:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:44:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:44:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:44:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:44:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 09:44:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:44:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:44:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:44:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 09:44:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 09:44:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:44:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 09:44:57,040 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:44:57,041 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 09:44:57,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:57 BoogieIcfgContainer [2019-11-22 09:44:57,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:44:57,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:44:57,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:44:57,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:44:57,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:44:55" (1/3) ... [2019-11-22 09:44:57,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65980b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:57, skipping insertion in model container [2019-11-22 09:44:57,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:56" (2/3) ... [2019-11-22 09:44:57,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65980b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:57, skipping insertion in model container [2019-11-22 09:44:57,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:57" (3/3) ... [2019-11-22 09:44:57,051 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-22 09:44:57,061 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:44:57,069 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-22 09:44:57,081 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-22 09:44:57,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:44:57,102 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:44:57,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:44:57,102 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:44:57,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:44:57,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:44:57,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:44:57,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:44:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-22 09:44:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 09:44:57,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:57,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:57,137 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 09:44:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-22 09:44:57,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:57,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [874465268] [2019-11-22 09:44:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:57,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 09:44:57,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:57,416 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874465268] [2019-11-22 09:44:57,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:57,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:44:57,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762705848] [2019-11-22 09:44:57,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 09:44:57,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 09:44:57,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 09:44:57,467 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-22 09:44:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:57,493 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-22 09:44:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 09:44:57,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 09:44:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:57,506 INFO L225 Difference]: With dead ends: 110 [2019-11-22 09:44:57,507 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 09:44:57,509 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 09:44:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 09:44:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 09:44:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 09:44:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-22 09:44:57,558 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-22 09:44:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:57,559 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-22 09:44:57,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 09:44:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-22 09:44:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:44:57,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:57,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:57,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:57,772 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 09:44:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-22 09:44:57,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:57,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [375948465] [2019-11-22 09:44:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:57,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 09:44:57,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:58,036 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 09:44:58,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:58,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:58,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:58,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:44:58,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:58,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 09:44:58,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:58,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:58,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:58,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 09:44:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:58,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:58,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 09:44:58,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [375948465] [2019-11-22 09:44:58,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:44:58,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748933355] [2019-11-22 09:44:58,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:58,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:58,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:58,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:58,275 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-11-22 09:44:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:59,389 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-22 09:44:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 09:44:59,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 09:44:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:59,396 INFO L225 Difference]: With dead ends: 119 [2019-11-22 09:44:59,397 INFO L226 Difference]: Without dead ends: 119 [2019-11-22 09:44:59,398 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 09:44:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-22 09:44:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2019-11-22 09:44:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 09:44:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-22 09:44:59,415 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 9 [2019-11-22 09:44:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:59,416 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-22 09:44:59,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-22 09:44:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:44:59,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:59,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:59,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:59,621 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 09:44:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-22 09:44:59,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:59,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991649263] [2019-11-22 09:44:59,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:59,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:44:59,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:59,813 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 09:44:59,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:59,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:59,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:59,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 09:44:59,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:59,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 09:44:59,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:59,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:59,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:59,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 09:44:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:59,960 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:00,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991649263] [2019-11-22 09:45:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:00,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:45:00,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161574912] [2019-11-22 09:45:00,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:45:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:45:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:45:00,207 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 8 states. [2019-11-22 09:45:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:01,453 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-22 09:45:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:45:01,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 09:45:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:01,457 INFO L225 Difference]: With dead ends: 115 [2019-11-22 09:45:01,457 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 09:45:01,457 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 09:45:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 09:45:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-11-22 09:45:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 09:45:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-22 09:45:01,470 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 9 [2019-11-22 09:45:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:01,470 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-22 09:45:01,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:45:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-22 09:45:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:45:01,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:01,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:01,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:01,674 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 09:45:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-22 09:45:01,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:01,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2023319211] [2019-11-22 09:45:01,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:01,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:45:01,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:01,859 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 09:45:01,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:01,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:01,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:01,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:45:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:01,876 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:01,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2023319211] [2019-11-22 09:45:01,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:01,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 09:45:01,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754142625] [2019-11-22 09:45:01,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:45:01,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:45:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:45:01,896 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2019-11-22 09:45:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:02,147 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-11-22 09:45:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:45:02,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:45:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:02,150 INFO L225 Difference]: With dead ends: 109 [2019-11-22 09:45:02,150 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 09:45:02,150 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 09:45:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 09:45:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-22 09:45:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 09:45:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-22 09:45:02,159 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 10 [2019-11-22 09:45:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:02,159 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-22 09:45:02,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:45:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-22 09:45:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:45:02,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:02,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:02,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:02,373 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 09:45:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-22 09:45:02,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:02,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [112658888] [2019-11-22 09:45:02,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:02,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:45:02,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:02,572 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 09:45:02,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:02,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:02,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:02,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:45:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:02,600 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:02,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112658888] [2019-11-22 09:45:02,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:02,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:45:02,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357279122] [2019-11-22 09:45:02,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:45:02,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:45:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:45:02,658 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-22 09:45:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:02,970 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-11-22 09:45:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:45:02,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:45:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:02,972 INFO L225 Difference]: With dead ends: 108 [2019-11-22 09:45:02,972 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 09:45:02,972 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 09:45:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 09:45:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-22 09:45:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-22 09:45:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-22 09:45:02,982 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 10 [2019-11-22 09:45:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:02,983 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-22 09:45:02,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:45:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-22 09:45:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 09:45:02,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:02,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:03,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:03,187 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 09:45:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-22 09:45:03,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:03,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1651496790] [2019-11-22 09:45:03,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:03,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:45:03,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:03,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:45:03,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:03,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:03,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:03,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:45:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:03,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:03,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1651496790] [2019-11-22 09:45:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:03,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:45:03,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007710860] [2019-11-22 09:45:03,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 09:45:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 09:45:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 09:45:03,415 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2019-11-22 09:45:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:03,576 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-22 09:45:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:45:03,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-22 09:45:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:03,577 INFO L225 Difference]: With dead ends: 106 [2019-11-22 09:45:03,577 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 09:45:03,577 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 09:45:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 09:45:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-22 09:45:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 09:45:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 09:45:03,585 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 15 [2019-11-22 09:45:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:03,585 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 09:45:03,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 09:45:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 09:45:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 09:45:03,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:03,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:03,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:03,799 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 09:45:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-22 09:45:03,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:03,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [180554135] [2019-11-22 09:45:03,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:04,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:45:04,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:04,012 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 09:45:04,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:04,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:04,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:04,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:45:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:04,028 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:04,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180554135] [2019-11-22 09:45:04,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:04,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:45:04,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869838227] [2019-11-22 09:45:04,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:45:04,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:45:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:45:04,068 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 4 states. [2019-11-22 09:45:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:04,345 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 09:45:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:45:04,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 09:45:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:04,348 INFO L225 Difference]: With dead ends: 107 [2019-11-22 09:45:04,348 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 09:45:04,348 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 09:45:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 09:45:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-11-22 09:45:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 09:45:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 09:45:04,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 15 [2019-11-22 09:45:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:04,365 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 09:45:04,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:45:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 09:45:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 09:45:04,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:04,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:04,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:04,571 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 09:45:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-22 09:45:04,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:04,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1125008155] [2019-11-22 09:45:04,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:04,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:45:04,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:04,758 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 09:45:04,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:04,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:04,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:04,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:45:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:04,774 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:04,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125008155] [2019-11-22 09:45:04,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:04,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-22 09:45:04,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22008858] [2019-11-22 09:45:04,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:45:04,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:04,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:45:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:45:04,848 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 6 states. [2019-11-22 09:45:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:05,345 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-22 09:45:05,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:45:05,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 09:45:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:05,349 INFO L225 Difference]: With dead ends: 140 [2019-11-22 09:45:05,349 INFO L226 Difference]: Without dead ends: 140 [2019-11-22 09:45:05,350 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 09:45:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-22 09:45:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2019-11-22 09:45:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 09:45:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-22 09:45:05,356 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2019-11-22 09:45:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:05,356 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-22 09:45:05,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:45:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-22 09:45:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 09:45:05,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:05,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:45:05,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:05,567 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 09:45:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:05,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-22 09:45:05,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:05,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2110209021] [2019-11-22 09:45:05,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:05,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:45:05,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:05,765 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 09:45:05,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:05,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:05,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:05,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:45:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:05,793 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:05,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2110209021] [2019-11-22 09:45:05,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:05,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 09:45:05,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64705058] [2019-11-22 09:45:05,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:45:05,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:45:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:45:05,885 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 6 states. [2019-11-22 09:45:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:06,598 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-11-22 09:45:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:45:06,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 09:45:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:06,600 INFO L225 Difference]: With dead ends: 110 [2019-11-22 09:45:06,601 INFO L226 Difference]: Without dead ends: 110 [2019-11-22 09:45:06,601 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 09:45:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-22 09:45:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-22 09:45:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 09:45:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 09:45:06,607 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 16 [2019-11-22 09:45:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:06,607 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 09:45:06,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:45:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 09:45:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:45:06,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:06,608 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 09:45:06,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:06,811 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 09:45:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-22 09:45:06,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:06,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1126470026] [2019-11-22 09:45:06,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:07,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:45:07,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:07,071 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:07,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126470026] [2019-11-22 09:45:07,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:07,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 09:45:07,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243399741] [2019-11-22 09:45:07,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:45:07,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:07,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:45:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:45:07,122 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2019-11-22 09:45:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:07,680 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 09:45:07,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:45:07,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 09:45:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:07,681 INFO L225 Difference]: With dead ends: 107 [2019-11-22 09:45:07,681 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 09:45:07,682 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 09:45:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 09:45:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-22 09:45:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-22 09:45:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-22 09:45:07,686 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 18 [2019-11-22 09:45:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:07,686 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-22 09:45:07,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:45:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-22 09:45:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:45:07,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:07,687 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 09:45:07,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:07,890 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 09:45:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-22 09:45:07,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:07,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1711198820] [2019-11-22 09:45:07,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:08,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:45:08,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:08,102 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:08,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711198820] [2019-11-22 09:45:08,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:08,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 09:45:08,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544689138] [2019-11-22 09:45:08,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:45:08,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:45:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:45:08,150 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2019-11-22 09:45:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:08,541 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-22 09:45:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:45:08,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 09:45:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:08,543 INFO L225 Difference]: With dead ends: 142 [2019-11-22 09:45:08,543 INFO L226 Difference]: Without dead ends: 142 [2019-11-22 09:45:08,543 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 09:45:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-22 09:45:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-11-22 09:45:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-22 09:45:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-22 09:45:08,548 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 18 [2019-11-22 09:45:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:08,548 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-22 09:45:08,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:45:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-22 09:45:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:45:08,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:08,549 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 09:45:08,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:08,750 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 09:45:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-22 09:45:08,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:08,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1195955076] [2019-11-22 09:45:08,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:08,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 09:45:08,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:08,968 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:08,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1195955076] [2019-11-22 09:45:08,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:08,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 09:45:08,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119595283] [2019-11-22 09:45:08,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:45:08,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:45:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:45:08,984 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 4 states. [2019-11-22 09:45:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:09,050 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-22 09:45:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:45:09,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 09:45:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:09,052 INFO L225 Difference]: With dead ends: 113 [2019-11-22 09:45:09,052 INFO L226 Difference]: Without dead ends: 113 [2019-11-22 09:45:09,052 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 09:45:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-22 09:45:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-22 09:45:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 09:45:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-11-22 09:45:09,056 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 18 [2019-11-22 09:45:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:09,057 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-11-22 09:45:09,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:45:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-11-22 09:45:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:45:09,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:09,058 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 09:45:09,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:09,266 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 09:45:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-22 09:45:09,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:09,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2083980557] [2019-11-22 09:45:09,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:09,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:45:09,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:09,608 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 09:45:09,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:09,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:45:09,635 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 09:45:09,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:09,662 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 09:45:09,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:09,677 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 09:45:09,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-22 09:45:09,746 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 21 treesize of output 9 [2019-11-22 09:45:09,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:09,770 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 09:45:09,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:09,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:09,782 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 09:45:09,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-22 09:45:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:09,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:10,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083980557] [2019-11-22 09:45:10,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:10,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:45:10,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465213522] [2019-11-22 09:45:10,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:45:10,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:45:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:45:10,174 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2019-11-22 09:45:11,075 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-22 09:45:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:11,922 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-22 09:45:11,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:45:11,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 09:45:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:11,924 INFO L225 Difference]: With dead ends: 120 [2019-11-22 09:45:11,925 INFO L226 Difference]: Without dead ends: 120 [2019-11-22 09:45:11,925 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 09:45:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-22 09:45:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2019-11-22 09:45:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-22 09:45:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-11-22 09:45:11,929 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 19 [2019-11-22 09:45:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:11,929 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-11-22 09:45:11,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:45:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-11-22 09:45:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 09:45:11,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:11,930 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 09:45:12,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:12,133 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 09:45:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-22 09:45:12,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:12,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1042702228] [2019-11-22 09:45:12,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:12,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:45:12,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:12,348 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 09:45:12,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:12,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:12,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:12,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:45:12,358 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 09:45:12,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:12,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:12,366 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 09:45:12,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-22 09:45:12,381 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 09:45:12,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:12,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:12,393 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 09:45:12,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-22 09:45:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:12,403 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:12,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1042702228] [2019-11-22 09:45:12,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:12,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:45:12,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817073886] [2019-11-22 09:45:12,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:45:12,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:12,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:45:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:45:12,424 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 5 states. [2019-11-22 09:45:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:45:12,815 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-22 09:45:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:45:12,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 09:45:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:45:12,817 INFO L225 Difference]: With dead ends: 115 [2019-11-22 09:45:12,817 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 09:45:12,818 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 09:45:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 09:45:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-11-22 09:45:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-22 09:45:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-22 09:45:12,823 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 19 [2019-11-22 09:45:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:45:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-22 09:45:12,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:45:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-22 09:45:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 09:45:12,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:45:12,825 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 09:45:13,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:45:13,030 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 09:45:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:45:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-22 09:45:13,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:45:13,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [917328136] [2019-11-22 09:45:13,030 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 09:45:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:45:13,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:45:13,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:45:13,286 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 09:45:13,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:13,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:13,303 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 09:45:13,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:13,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:13,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:45:13,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-22 09:45:13,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:45:13,384 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 09:45:13,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:13,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:13,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:45:13,421 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 11 treesize of output 7 [2019-11-22 09:45:13,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:45:13,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:45:13,433 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 09:45:13,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-22 09:45:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:13,459 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:45:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:13,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:13,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:17,446 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-22 09:45:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:45:17,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [917328136] [2019-11-22 09:45:17,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:45:17,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:45:17,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997926248] [2019-11-22 09:45:17,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:45:17,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:45:17,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:45:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-22 09:45:17,963 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-22 09:45:23,206 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-22 09:45:40,251 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-22 09:45:50,926 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 09:46:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:46:38,236 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-11-22 09:46:38,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:46:38,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 09:46:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:46:38,251 INFO L225 Difference]: With dead ends: 128 [2019-11-22 09:46:38,251 INFO L226 Difference]: Without dead ends: 128 [2019-11-22 09:46:38,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=55, Invalid=147, Unknown=8, NotChecked=0, Total=210 [2019-11-22 09:46:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-22 09:46:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2019-11-22 09:46:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 09:46:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-22 09:46:38,257 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 20 [2019-11-22 09:46:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:46:38,258 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-22 09:46:38,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:46:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-22 09:46:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 09:46:38,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:46:38,259 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 09:46:38,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:46:38,460 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 09:46:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:46:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-22 09:46:38,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:46:38,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [710008241] [2019-11-22 09:46:38,461 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 09:46:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:46:38,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:46:38,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:46:38,687 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 09:46:38,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:38,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-22 09:46:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:38,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:46:38,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:38,769 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 09:46:38,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:38,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:38,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-22 09:46:38,792 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 09:46:38,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:38,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:46:38,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-22 09:46:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:38,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [710008241] [2019-11-22 09:46:38,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:46:38,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:46:38,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180497588] [2019-11-22 09:46:38,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:46:38,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:46:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:46:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:46:38,805 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2019-11-22 09:46:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:46:39,108 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 09:46:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:46:39,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 09:46:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:46:39,110 INFO L225 Difference]: With dead ends: 107 [2019-11-22 09:46:39,111 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 09:46:39,111 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 09:46:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 09:46:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 09:46:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 09:46:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-22 09:46:39,120 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-22 09:46:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:46:39,121 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-22 09:46:39,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:46:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-22 09:46:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 09:46:39,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:46:39,122 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 09:46:39,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:46:39,323 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 09:46:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:46:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-22 09:46:39,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:46:39,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [673948888] [2019-11-22 09:46:39,324 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 09:46:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:46:39,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 09:46:39,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:46:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:39,571 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:46:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:39,697 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 09:46:39,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:46:39,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:39,715 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 09:46:39,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-22 09:46:39,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:39,838 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 09:46:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:39,841 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 09:46:39,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:39,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:39,898 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 09:46:39,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-11-22 09:46:39,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:39,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [673948888] [2019-11-22 09:46:40,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:46:40,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:46:40,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040529393] [2019-11-22 09:46:40,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:46:40,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:46:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:46:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:46:40,755 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 10 states. [2019-11-22 09:46:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:46:41,236 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-11-22 09:46:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:46:41,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 09:46:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:46:41,239 INFO L225 Difference]: With dead ends: 102 [2019-11-22 09:46:41,239 INFO L226 Difference]: Without dead ends: 102 [2019-11-22 09:46:41,240 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 09:46:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-22 09:46:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-22 09:46:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 09:46:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 09:46:41,243 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2019-11-22 09:46:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:46:41,243 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 09:46:41,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:46:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 09:46:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 09:46:41,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:46:41,245 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 09:46:41,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:46:41,448 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 09:46:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:46:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-22 09:46:41,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:46:41,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1584728259] [2019-11-22 09:46:41,450 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 09:46:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:46:41,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 09:46:41,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:46:41,718 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 09:46:41,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:41,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:41,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:46:41,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:46:41,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:46:41,762 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 09:46:41,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:41,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:41,778 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 09:46:41,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2019-11-22 09:46:41,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:46:41,875 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 09:46:41,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:41,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:41,904 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 09:46:41,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-22 09:46:42,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:46:42,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:46:42,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:46:42,065 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 09:46:42,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:46:42,188 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-22 09:46:42,189 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-11-22 09:46:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:42,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 09:46:42,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:46 [2019-11-22 09:46:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:42,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:43,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:46:43,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:44,747 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-22 09:46:44,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:49,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:46:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:46:49,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1584728259] [2019-11-22 09:46:49,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:46:49,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-22 09:46:49,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153660350] [2019-11-22 09:46:49,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 09:46:49,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:46:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 09:46:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=197, Unknown=1, NotChecked=0, Total=240 [2019-11-22 09:46:49,743 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 16 states. [2019-11-22 09:47:04,799 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-22 09:47:22,614 WARN L192 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-22 09:47:39,925 WARN L192 SmtUtils]: Spent 7.19 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-22 09:47:48,803 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-11-22 09:50:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:50:03,115 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2019-11-22 09:50:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 09:50:03,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-22 09:50:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:50:03,122 INFO L225 Difference]: With dead ends: 157 [2019-11-22 09:50:03,122 INFO L226 Difference]: Without dead ends: 157 [2019-11-22 09:50:03,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=103, Invalid=496, Unknown=1, NotChecked=0, Total=600 [2019-11-22 09:50:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-22 09:50:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-11-22 09:50:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-22 09:50:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2019-11-22 09:50:03,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 22 [2019-11-22 09:50:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:50:03,132 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2019-11-22 09:50:03,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 09:50:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2019-11-22 09:50:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 09:50:03,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:50:03,134 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 09:50:03,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:50:03,337 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 09:50:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:50:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-22 09:50:03,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:50:03,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [575726306] [2019-11-22 09:50:03,339 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 09:50:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:50:03,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 09:50:03,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:50:03,589 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 09:50:03,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:50:03,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:50:03,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:50:03,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 09:50:03,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 09:50:03,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:50:03,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:50:03,642 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 09:50:03,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-11-22 09:50:03,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:50:03,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 09:50:03,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:50:03,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:50:03,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:50:03,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2019-11-22 09:50:04,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:50:04,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:50:04,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:50:04,054 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 09:50:04,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:50:04,131 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-22 09:50:04,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 09:50:04,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:30 [2019-11-22 09:50:04,195 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 09:50:04,195 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:50:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:50:04,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:50:04,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:50:04,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:50:04,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:50:05,399 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-11-22 09:50:05,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:50:05,636 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 09:50:05,642 INFO L168 Benchmark]: Toolchain (without parser) took 310319.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.2 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -240.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-22 09:50:05,642 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:50:05,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:50:05,643 INFO L168 Benchmark]: Boogie Preprocessor took 79.91 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 09:50:05,644 INFO L168 Benchmark]: RCFGBuilder took 932.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:50:05,644 INFO L168 Benchmark]: TraceAbstraction took 308595.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:50:05,646 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.91 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 932.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 308595.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.3 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...