./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 a88b43a3 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-a88b43a [2019-11-20 12:11:07,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 12:11:07,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 12:11:07,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 12:11:07,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 12:11:07,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 12:11:07,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 12:11:07,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 12:11:07,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 12:11:07,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 12:11:07,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 12:11:07,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 12:11:07,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 12:11:07,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 12:11:07,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 12:11:07,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 12:11:07,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 12:11:07,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 12:11:07,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 12:11:08,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 12:11:08,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 12:11:08,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 12:11:08,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 12:11:08,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 12:11:08,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 12:11:08,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 12:11:08,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 12:11:08,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 12:11:08,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 12:11:08,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 12:11:08,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 12:11:08,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 12:11:08,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 12:11:08,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 12:11:08,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 12:11:08,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 12:11:08,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 12:11:08,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 12:11:08,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 12:11:08,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 12:11:08,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 12:11:08,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-20 12:11:08,037 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 12:11:08,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 12:11:08,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 12:11:08,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 12:11:08,040 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 12:11:08,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 12:11:08,041 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 12:11:08,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 12:11:08,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 12:11:08,042 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 12:11:08,043 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 12:11:08,044 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 12:11:08,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 12:11:08,045 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 12:11:08,045 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 12:11:08,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 12:11:08,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 12:11:08,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 12:11:08,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 12:11:08,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 12:11:08,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 12:11:08,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 12:11:08,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 12:11:08,049 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 12:11:08,049 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 12:11:08,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 12:11:08,050 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-20 12:11:08,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 12:11:08,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 12:11:08,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 12:11:08,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 12:11:08,396 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 12:11:08,396 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-20 12:11:08,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b8e9324/d9d8d46ceb4b4acda24e944c60cc1df1/FLAG6994879ab [2019-11-20 12:11:09,020 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 12:11:09,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 12:11:09,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b8e9324/d9d8d46ceb4b4acda24e944c60cc1df1/FLAG6994879ab [2019-11-20 12:11:09,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b8e9324/d9d8d46ceb4b4acda24e944c60cc1df1 [2019-11-20 12:11:09,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 12:11:09,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 12:11:09,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 12:11:09,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 12:11:09,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 12:11:09,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:09,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542bfd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09, skipping insertion in model container [2019-11-20 12:11:09,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:09,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 12:11:09,365 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 12:11:09,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 12:11:09,823 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 12:11:09,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 12:11:09,948 INFO L192 MainTranslator]: Completed translation [2019-11-20 12:11:09,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09 WrapperNode [2019-11-20 12:11:09,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 12:11:09,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 12:11:09,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 12:11:09,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 12:11:09,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:09,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:09,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:09,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:10,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:10,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:10,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (1/1) ... [2019-11-20 12:11:10,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 12:11:10,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 12:11:10,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 12:11:10,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 12:11:10,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (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-20 12:11:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 12:11:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 12:11:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 12:11:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 12:11:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 12:11:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 12:11:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 12:11:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 12:11:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 12:11:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 12:11:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 12:11:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 12:11:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 12:11:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 12:11:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 12:11:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 12:11:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 12:11:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 12:11:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 12:11:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 12:11:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 12:11:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 12:11:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 12:11:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 12:11:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 12:11:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 12:11:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 12:11:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 12:11:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 12:11:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 12:11:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 12:11:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 12:11:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 12:11:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 12:11:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 12:11:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 12:11:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 12:11:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 12:11:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 12:11:10,100 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 12:11:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 12:11:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 12:11:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 12:11:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 12:11:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 12:11:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 12:11:11,014 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 12:11:11,014 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 12:11:11,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:11 BoogieIcfgContainer [2019-11-20 12:11:11,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 12:11:11,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 12:11:11,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 12:11:11,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 12:11:11,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:11:09" (1/3) ... [2019-11-20 12:11:11,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55852af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:11, skipping insertion in model container [2019-11-20 12:11:11,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:09" (2/3) ... [2019-11-20 12:11:11,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55852af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:11, skipping insertion in model container [2019-11-20 12:11:11,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:11" (3/3) ... [2019-11-20 12:11:11,025 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-20 12:11:11,035 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 12:11:11,044 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 12:11:11,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 12:11:11,076 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 12:11:11,077 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 12:11:11,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 12:11:11,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 12:11:11,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 12:11:11,078 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 12:11:11,078 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 12:11:11,078 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 12:11:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 12:11:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 12:11:11,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:11,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:11,107 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-20 12:11:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 12:11:11,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:11,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [939251608] [2019-11-20 12:11:11,124 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-20 12:11:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:11,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 12:11:11,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:11,368 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-20 12:11:11,368 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:11,384 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-20 12:11:11,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [939251608] [2019-11-20 12:11:11,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:11,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 12:11:11,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109479889] [2019-11-20 12:11:11,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 12:11:11,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 12:11:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 12:11:11,412 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 12:11:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:11,438 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 12:11:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 12:11:11,440 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 12:11:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:11,451 INFO L225 Difference]: With dead ends: 110 [2019-11-20 12:11:11,451 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 12:11:11,453 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-20 12:11:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 12:11:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 12:11:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 12:11:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 12:11:11,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 12:11:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:11,504 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 12:11:11,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 12:11:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 12:11:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 12:11:11,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:11,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:11,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:11,710 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-20 12:11:11,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:11,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 12:11:11,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:11,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [956518915] [2019-11-20 12:11:11,711 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-20 12:11:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:11,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 12:11:11,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:11,969 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-20 12:11:11,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:11,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:11,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:11,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:11:12,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:12,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 12:11:12,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:12,053 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 12:11:12,054 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-20 12:11:12,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 12:11:12,073 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-20 12:11:12,074 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:12,095 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-20 12:11:12,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [956518915] [2019-11-20 12:11:12,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:12,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 12:11:12,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77708302] [2019-11-20 12:11:12,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 12:11:12,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:12,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 12:11:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:11:12,099 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 12:11:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:12,617 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 12:11:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 12:11:12,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 12:11:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:12,622 INFO L225 Difference]: With dead ends: 116 [2019-11-20 12:11:12,623 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 12:11:12,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 12:11:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 12:11:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 12:11:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 12:11:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 12:11:12,641 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 12:11:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 12:11:12,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 12:11:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 12:11:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 12:11:12,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:12,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:12,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:12,848 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-20 12:11:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 12:11:12,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:12,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1973243745] [2019-11-20 12:11:12,850 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-20 12:11:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:13,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 12:11:13,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:13,093 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-20 12:11:13,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:13,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:13,110 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-20 12:11:13,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:13,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:13,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:13,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 12:11:13,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:11:13,177 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-20 12:11:13,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:13,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:13,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:11:13,214 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 13 treesize of output 9 [2019-11-20 12:11:13,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:13,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:13,242 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-20 12:11:13,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-20 12:11:13,272 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-20 12:11:13,272 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:11:13,649 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-20 12:11:13,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1973243745] [2019-11-20 12:11:13,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:13,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 12:11:13,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531102214] [2019-11-20 12:11:13,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 12:11:13,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:13,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 12:11:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:11:13,652 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 12:11:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:18,071 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 12:11:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 12:11:18,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 12:11:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:18,074 INFO L225 Difference]: With dead ends: 115 [2019-11-20 12:11:18,074 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 12:11:18,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 12:11:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 12:11:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 12:11:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 12:11:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 12:11:18,085 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 12:11:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:18,086 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 12:11:18,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 12:11:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 12:11:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 12:11:18,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:18,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:18,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:18,289 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-20 12:11:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 12:11:18,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:18,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [139098885] [2019-11-20 12:11:18,291 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-20 12:11:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:18,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 12:11:18,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:18,510 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-20 12:11:18,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:18,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:18,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:18,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:11:18,529 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-20 12:11:18,529 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:18,556 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-20 12:11:18,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [139098885] [2019-11-20 12:11:18,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:18,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 12:11:18,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765923635] [2019-11-20 12:11:18,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:11:18,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:18,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:11:18,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:11:18,562 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 12:11:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:18,749 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 12:11:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 12:11:18,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 12:11:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:18,751 INFO L225 Difference]: With dead ends: 108 [2019-11-20 12:11:18,751 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 12:11:18,752 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-20 12:11:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 12:11:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 12:11:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 12:11:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 12:11:18,760 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 12:11:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:18,761 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 12:11:18,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:11:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 12:11:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 12:11:18,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:18,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:18,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:18,964 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-20 12:11:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 12:11:18,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:18,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2037162500] [2019-11-20 12:11:18,967 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-20 12:11:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:19,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:11:19,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:19,151 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-20 12:11:19,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:19,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:19,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:19,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:11:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:11:19,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:19,211 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-20 12:11:19,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2037162500] [2019-11-20 12:11:19,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:19,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 12:11:19,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404229976] [2019-11-20 12:11:19,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:11:19,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:11:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:11:19,213 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 12:11:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:19,628 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 12:11:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 12:11:19,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 12:11:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:19,631 INFO L225 Difference]: With dead ends: 107 [2019-11-20 12:11:19,631 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 12:11:19,632 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-20 12:11:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 12:11:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 12:11:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 12:11:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 12:11:19,640 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 12:11:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:19,640 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 12:11:19,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:11:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 12:11:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 12:11:19,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:19,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:19,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:19,845 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-20 12:11:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 12:11:19,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:19,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1002152285] [2019-11-20 12:11:19,847 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-20 12:11:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:20,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 12:11:20,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:20,062 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-20 12:11:20,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:20,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:20,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:20,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:11:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:11:20,073 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:20,081 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-20 12:11:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002152285] [2019-11-20 12:11:20,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:20,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 12:11:20,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104965609] [2019-11-20 12:11:20,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 12:11:20,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 12:11:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 12:11:20,084 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 12:11:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:20,293 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 12:11:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 12:11:20,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 12:11:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:20,294 INFO L225 Difference]: With dead ends: 105 [2019-11-20 12:11:20,294 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 12:11:20,295 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-20 12:11:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 12:11:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 12:11:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 12:11:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 12:11:20,306 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 12:11:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:20,307 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 12:11:20,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 12:11:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 12:11:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 12:11:20,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:20,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:20,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:20,511 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-20 12:11:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 12:11:20,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:20,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1375375039] [2019-11-20 12:11:20,513 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-20 12:11:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:20,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:11:20,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:20,715 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-20 12:11:20,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:20,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:20,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:20,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:11:20,734 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-20 12:11:20,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:11:20,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375375039] [2019-11-20 12:11:20,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:20,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 12:11:20,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022946784] [2019-11-20 12:11:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:11:20,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:11:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:11:20,769 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 12:11:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:21,103 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 12:11:21,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 12:11:21,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 12:11:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:21,106 INFO L225 Difference]: With dead ends: 106 [2019-11-20 12:11:21,106 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 12:11:21,107 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-20 12:11:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 12:11:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 12:11:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 12:11:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 12:11:21,114 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 12:11:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:21,114 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 12:11:21,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:11:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 12:11:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 12:11:21,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:21,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:21,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:21,318 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-20 12:11:21,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 12:11:21,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:21,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1196470500] [2019-11-20 12:11:21,320 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-20 12:11:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:21,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 12:11:21,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:21,516 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-20 12:11:21,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:21,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:21,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:21,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:11:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 12:11:21,533 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:21,580 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-20 12:11:21,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1196470500] [2019-11-20 12:11:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:21,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 12:11:21,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494133872] [2019-11-20 12:11:21,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 12:11:21,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 12:11:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 12:11:21,581 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 12:11:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:22,105 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 12:11:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:11:22,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 12:11:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:22,108 INFO L225 Difference]: With dead ends: 135 [2019-11-20 12:11:22,108 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 12:11:22,108 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-20 12:11:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 12:11:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 12:11:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 12:11:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 12:11:22,114 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 12:11:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:22,114 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 12:11:22,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 12:11:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 12:11:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 12:11:22,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:22,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 12:11:22,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:22,318 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-20 12:11:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 12:11:22,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:22,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1320975806] [2019-11-20 12:11:22,319 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-20 12:11:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:22,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 12:11:22,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:22,513 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-20 12:11:22,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:22,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:22,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:22,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:11:22,562 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-20 12:11:22,563 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:22,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:11:22,646 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-20 12:11:22,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320975806] [2019-11-20 12:11:22,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:22,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 12:11:22,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749051872] [2019-11-20 12:11:22,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 12:11:22,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 12:11:22,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 12:11:22,648 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 12:11:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:23,188 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 12:11:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:11:23,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 12:11:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:23,192 INFO L225 Difference]: With dead ends: 109 [2019-11-20 12:11:23,192 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 12:11:23,192 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-20 12:11:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 12:11:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 12:11:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 12:11:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 12:11:23,198 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 12:11:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:23,198 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 12:11:23,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 12:11:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 12:11:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 12:11:23,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:23,200 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-20 12:11:23,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:23,404 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-20 12:11:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 12:11:23,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:23,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2026827979] [2019-11-20 12:11:23,406 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-20 12:11:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:23,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 12:11:23,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:23,636 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-20 12:11:23,636 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:23,671 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-20 12:11:23,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2026827979] [2019-11-20 12:11:23,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:23,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 12:11:23,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830906286] [2019-11-20 12:11:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 12:11:23,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 12:11:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:11:23,675 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 12:11:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:24,108 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 12:11:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 12:11:24,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 12:11:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:24,112 INFO L225 Difference]: With dead ends: 135 [2019-11-20 12:11:24,112 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 12:11:24,112 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-20 12:11:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 12:11:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 12:11:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 12:11:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 12:11:24,120 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 12:11:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 12:11:24,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 12:11:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 12:11:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 12:11:24,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:24,122 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-20 12:11:24,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:24,323 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-20 12:11:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 12:11:24,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:24,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [314233182] [2019-11-20 12:11:24,325 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-20 12:11:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:24,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 12:11:24,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:24,608 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-20 12:11:24,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:24,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:11:24,698 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-20 12:11:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [314233182] [2019-11-20 12:11:24,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:24,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 12:11:24,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349049030] [2019-11-20 12:11:24,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 12:11:24,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 12:11:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 12:11:24,700 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 12:11:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:25,600 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 12:11:25,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 12:11:25,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 12:11:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:25,602 INFO L225 Difference]: With dead ends: 104 [2019-11-20 12:11:25,602 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 12:11:25,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-20 12:11:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 12:11:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 12:11:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 12:11:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 12:11:25,607 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 12:11:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:25,607 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 12:11:25,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 12:11:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 12:11:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 12:11:25,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:25,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-20 12:11:25,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:25,817 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-20 12:11:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 12:11:25,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:25,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1448037720] [2019-11-20 12:11:25,819 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-20 12:11:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:26,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 12:11:26,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:26,034 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-20 12:11:26,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:26,042 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-20 12:11:26,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448037720] [2019-11-20 12:11:26,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:26,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 12:11:26,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475361629] [2019-11-20 12:11:26,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 12:11:26,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 12:11:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 12:11:26,044 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 12:11:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:26,100 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 12:11:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 12:11:26,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 12:11:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:26,106 INFO L225 Difference]: With dead ends: 112 [2019-11-20 12:11:26,106 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 12:11:26,106 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-20 12:11:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 12:11:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 12:11:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 12:11:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 12:11:26,111 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 12:11:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:26,111 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 12:11:26,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 12:11:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 12:11:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:11:26,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:26,117 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-20 12:11:26,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:26,321 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-20 12:11:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 12:11:26,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:26,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [426871543] [2019-11-20 12:11:26,322 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-20 12:11:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:26,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:11:26,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:26,535 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-20 12:11:26,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:26,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:26,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:26,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 12:11:26,558 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-20 12:11:26,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:26,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:26,573 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-20 12:11:26,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 12:11:26,596 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-20 12:11:26,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:26,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:26,601 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-20 12:11:26,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 12:11:26,611 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-20 12:11:26,612 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:26,626 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-20 12:11:26,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [426871543] [2019-11-20 12:11:26,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:26,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 12:11:26,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741158814] [2019-11-20 12:11:26,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 12:11:26,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 12:11:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:11:26,628 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 12:11:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:27,005 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 12:11:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 12:11:27,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 12:11:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:27,006 INFO L225 Difference]: With dead ends: 114 [2019-11-20 12:11:27,006 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 12:11:27,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 12:11:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 12:11:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 12:11:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 12:11:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 12:11:27,011 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 12:11:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:27,012 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 12:11:27,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 12:11:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 12:11:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 12:11:27,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:27,013 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-20 12:11:27,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:27,221 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-20 12:11:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 12:11:27,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:27,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1663246948] [2019-11-20 12:11:27,223 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-20 12:11:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:27,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 12:11:27,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:27,450 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-20 12:11:27,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:27,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 12:11:27,483 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-20 12:11:27,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:27,507 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-20 12:11:27,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:27,527 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-20 12:11:27,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-20 12:11:27,577 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-20 12:11:27,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:27,600 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-20 12:11:27,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:27,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:27,608 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-20 12:11:27,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-20 12:11:27,624 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-20 12:11:27,624 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:27,932 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-20 12:11:27,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663246948] [2019-11-20 12:11:27,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:27,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 12:11:27,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703991945] [2019-11-20 12:11:27,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 12:11:27,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 12:11:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 12:11:27,933 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 12:11:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:11:29,677 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 12:11:29,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 12:11:29,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 12:11:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:11:29,679 INFO L225 Difference]: With dead ends: 113 [2019-11-20 12:11:29,679 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 12:11:29,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 12:11:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 12:11:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 12:11:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 12:11:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 12:11:29,684 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 12:11:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:11:29,684 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 12:11:29,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 12:11:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 12:11:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 12:11:29,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:11:29,685 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-20 12:11:29,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:11:29,888 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-20 12:11:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:11:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 12:11:29,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:11:29,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [590632607] [2019-11-20 12:11:29,889 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-20 12:11:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:11:30,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 12:11:30,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:11:30,147 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-20 12:11:30,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:30,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:30,158 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-20 12:11:30,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:30,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:30,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:11:30,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 12:11:30,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:11:30,227 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-20 12:11:30,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:30,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:30,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 12:11:30,255 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-20 12:11:30,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:11:30,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:11:30,264 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-20 12:11:30,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-20 12:11:30,285 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-20 12:11:30,285 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:11:30,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:11:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:11:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:34,094 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 12:11:34,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:11:34,542 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 12:11:34,698 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-20 12:11:34,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [590632607] [2019-11-20 12:11:34,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:11:34,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 12:11:34,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148264014] [2019-11-20 12:11:34,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 12:11:34,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:11:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 12:11:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 12:11:34,700 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 12:11:42,385 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-20 12:11:48,963 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-20 12:11:51,076 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_4 (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv12 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-20 12:12:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:12:11,157 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-11-20 12:12:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 12:12:11,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 12:12:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:12:11,160 INFO L225 Difference]: With dead ends: 127 [2019-11-20 12:12:11,160 INFO L226 Difference]: Without dead ends: 127 [2019-11-20 12:12:11,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=54, Invalid=129, Unknown=3, NotChecked=24, Total=210 [2019-11-20 12:12:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-20 12:12:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-20 12:12:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 12:12:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 12:12:11,166 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 12:12:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:12:11,166 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 12:12:11,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 12:12:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 12:12:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 12:12:11,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:12:11,168 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-20 12:12:11,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:12:11,371 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-20 12:12:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:12:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 12:12:11,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:12:11,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [322371830] [2019-11-20 12:12:11,373 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-20 12:12:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:12:11,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 12:12:11,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:12:11,604 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-20 12:12:11,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:11,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 12:12:11,624 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-20 12:12:11,624 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:12:11,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:11,683 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-20 12:12:11,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:11,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:11,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 12:12:11,695 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-20 12:12:11,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:11,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:12:11,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 12:12:11,701 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-20 12:12:11,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322371830] [2019-11-20 12:12:11,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:12:11,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 12:12:11,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721334933] [2019-11-20 12:12:11,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 12:12:11,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:12:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 12:12:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 12:12:11,703 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 12:12:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:12:11,982 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 12:12:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 12:12:11,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 12:12:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:12:11,984 INFO L225 Difference]: With dead ends: 112 [2019-11-20 12:12:11,984 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 12:12:11,985 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-20 12:12:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 12:12:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 12:12:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 12:12:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 12:12:11,988 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 12:12:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:12:11,989 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 12:12:11,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 12:12:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 12:12:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 12:12:11,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:12:11,990 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-20 12:12:12,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:12:12,192 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-20 12:12:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:12:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 12:12:12,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:12:12,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [913442123] [2019-11-20 12:12:12,194 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-20 12:12:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:12:12,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 12:12:12,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:12:12,493 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-20 12:12:12,493 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:12:12,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:12:12,616 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 14 treesize of output 12 [2019-11-20 12:12:12,616 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-20 12:12:12,627 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 12 treesize of output 10 [2019-11-20 12:12:12,627 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 12:12:12,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:12,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 12:12:12,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 12:12:12,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:12,800 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-20 12:12:12,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:12,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:12,803 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-20 12:12:12,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:12,836 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-20 12:12:12,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 12:12:12,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:12,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:13,583 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-20 12:12:13,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [913442123] [2019-11-20 12:12:13,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:12:13,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 12:12:13,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242384497] [2019-11-20 12:12:13,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 12:12:13,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:12:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 12:12:13,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 12:12:13,584 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 12:12:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:12:14,055 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 12:12:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 12:12:14,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 12:12:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:12:14,058 INFO L225 Difference]: With dead ends: 106 [2019-11-20 12:12:14,058 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 12:12:14,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 12:12:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 12:12:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 12:12:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 12:12:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 12:12:14,070 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 12:12:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:12:14,070 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 12:12:14,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 12:12:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 12:12:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 12:12:14,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:12:14,071 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-20 12:12:14,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:12:14,272 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-20 12:12:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:12:14,273 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 12:12:14,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:12:14,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [969136618] [2019-11-20 12:12:14,274 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-20 12:12:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:12:14,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 12:12:14,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:12:14,528 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-20 12:12:14,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,541 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-20 12:12:14,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 12:12:14,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 12:12:14,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,610 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-20 12:12:14,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,628 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 12:12:14,629 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-20 12:12:14,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 12:12:14,761 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 12:12:14,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:12:14,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:14,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-20 12:12:14,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:14,863 INFO L567 ElimStorePlain]: treesize reduction 18, result has 58.1 percent of original size [2019-11-20 12:12:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:14,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 12:12:14,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:25 [2019-11-20 12:12:14,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:14,974 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-20 12:12:14,974 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:12:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:12:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:12:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:12:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:18,949 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 12:12:18,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:12:20,157 WARN L192 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 12:12:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:12:20,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:20,344 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 13 treesize of output 17 [2019-11-20 12:12:20,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:12:20,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:12:20,366 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-20 12:12:20,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 12:12:20,667 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-20 12:12:20,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969136618] [2019-11-20 12:12:20,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 12:12:20,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 12:12:20,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452449799] [2019-11-20 12:12:20,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 12:12:20,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 12:12:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 12:12:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-11-20 12:12:20,669 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 16 states. [2019-11-20 12:12:31,744 WARN L192 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 12:12:45,263 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv12 32)) v_append_~pointerToList.base_BEFORE_CALL_10))))) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1)))))) (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv12 32)) |c_#length|)))) is different from false [2019-11-20 12:13:04,115 WARN L192 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 12:13:14,976 WARN L192 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 12:13:31,573 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 12:13:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 12:13:48,556 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-20 12:13:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 12:13:48,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-20 12:13:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 12:13:48,558 INFO L225 Difference]: With dead ends: 128 [2019-11-20 12:13:48,559 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 12:13:48,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=104, Invalid=400, Unknown=6, NotChecked=42, Total=552 [2019-11-20 12:13:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 12:13:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2019-11-20 12:13:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 12:13:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-11-20 12:13:48,565 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 22 [2019-11-20 12:13:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 12:13:48,565 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-11-20 12:13:48,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 12:13:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-11-20 12:13:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 12:13:48,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 12:13:48,566 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-20 12:13:48,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:13:48,767 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-20 12:13:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 12:13:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-20 12:13:48,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 12:13:48,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1029577102] [2019-11-20 12:13:48,769 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-20 12:13:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 12:13:49,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 12:13:49,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 12:13:49,023 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-20 12:13:49,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,035 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-20 12:13:49,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 12:13:49,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 12:13:49,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,170 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-20 12:13:49,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,198 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 12:13:49,198 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-20 12:13:49,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 12:13:49,270 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-20 12:13:49,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,284 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 13 treesize of output 17 [2019-11-20 12:13:49,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 12:13:49,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,372 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 12:13:49,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 12:13:49,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-20 12:13:49,411 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-20 12:13:49,411 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 12:13:49,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:13:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:13:49,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-20 12:13:49,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,896 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 32 treesize of output 36 [2019-11-20 12:13:49,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,909 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 22 treesize of output 26 [2019-11-20 12:13:49,910 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 12:13:49,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 12:13:49,963 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 3 xjuncts. [2019-11-20 12:13:49,963 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-20 12:13:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:13:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 12:13:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:50,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 12:13:50,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 12:13:52,800 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 12:13:52,805 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 12:13:52,809 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 12:13:52,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 12:13:52,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 12:13:52,847 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 12:13:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 12:13:52,860 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-20 12:13:52,899 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-20 12:13:52,902 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-20 12:13:53,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 12:13:53,103 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-20 12:13:53,108 INFO L168 Benchmark]: Toolchain (without parser) took 163796.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 122.4 MB. Max. memory is 11.5 GB. [2019-11-20 12:13:53,108 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 12:13:53,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-20 12:13:53,109 INFO L168 Benchmark]: Boogie Preprocessor took 75.30 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-20 12:13:53,109 INFO L168 Benchmark]: RCFGBuilder took 991.65 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.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-11-20 12:13:53,109 INFO L168 Benchmark]: TraceAbstraction took 162088.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -54.9 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-11-20 12:13:53,112 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 635.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.30 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 991.65 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.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 162088.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -54.9 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...