./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 65a59966 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-65a5996 [2019-11-20 19:03:03,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 19:03:03,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 19:03:03,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 19:03:03,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 19:03:03,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 19:03:03,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 19:03:03,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 19:03:03,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 19:03:03,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 19:03:03,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 19:03:03,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 19:03:03,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 19:03:03,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 19:03:03,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 19:03:03,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 19:03:03,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 19:03:03,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 19:03:03,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 19:03:03,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 19:03:03,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 19:03:03,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 19:03:03,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 19:03:03,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 19:03:03,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 19:03:03,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 19:03:03,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 19:03:03,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 19:03:03,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 19:03:03,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 19:03:03,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 19:03:03,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 19:03:03,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 19:03:03,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 19:03:03,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 19:03:03,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 19:03:03,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 19:03:03,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 19:03:03,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 19:03:03,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 19:03:03,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 19:03:03,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-20 19:03:03,336 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 19:03:03,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 19:03:03,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 19:03:03,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 19:03:03,338 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 19:03:03,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 19:03:03,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 19:03:03,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 19:03:03,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 19:03:03,339 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 19:03:03,339 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 19:03:03,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 19:03:03,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 19:03:03,340 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 19:03:03,340 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 19:03:03,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 19:03:03,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 19:03:03,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 19:03:03,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 19:03:03,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 19:03:03,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 19:03:03,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 19:03:03,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 19:03:03,342 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 19:03:03,342 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 19:03:03,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 19:03:03,343 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 19:03:03,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 19:03:03,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 19:03:03,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 19:03:03,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 19:03:03,647 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 19:03:03,648 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 19:03:03,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282e2dbf/7406eaaaba8f4d46bd49bff33a7060c8/FLAG806655046 [2019-11-20 19:03:04,219 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 19:03:04,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 19:03:04,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282e2dbf/7406eaaaba8f4d46bd49bff33a7060c8/FLAG806655046 [2019-11-20 19:03:04,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282e2dbf/7406eaaaba8f4d46bd49bff33a7060c8 [2019-11-20 19:03:04,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 19:03:04,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 19:03:04,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 19:03:04,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 19:03:04,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 19:03:04,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:03:04" (1/1) ... [2019-11-20 19:03:04,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385cd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:04, skipping insertion in model container [2019-11-20 19:03:04,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:03:04" (1/1) ... [2019-11-20 19:03:04,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 19:03:04,612 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 19:03:04,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 19:03:04,999 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 19:03:05,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 19:03:05,135 INFO L192 MainTranslator]: Completed translation [2019-11-20 19:03:05,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05 WrapperNode [2019-11-20 19:03:05,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 19:03:05,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 19:03:05,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 19:03:05,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 19:03:05,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (1/1) ... [2019-11-20 19:03:05,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 19:03:05,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 19:03:05,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 19:03:05,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 19:03:05,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (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 19:03:05,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 19:03:05,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 19:03:05,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 19:03:05,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 19:03:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 19:03:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 19:03:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 19:03:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 19:03:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 19:03:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 19:03:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 19:03:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 19:03:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 19:03:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 19:03:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 19:03:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 19:03:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 19:03:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 19:03:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 19:03:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 19:03:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 19:03:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 19:03:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 19:03:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 19:03:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 19:03:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 19:03:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 19:03:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 19:03:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 19:03:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 19:03:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 19:03:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 19:03:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 19:03:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 19:03:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 19:03:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 19:03:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 19:03:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 19:03:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 19:03:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 19:03:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 19:03:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 19:03:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 19:03:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 19:03:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 19:03:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 19:03:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 19:03:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 19:03:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 19:03:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 19:03:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 19:03:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 19:03:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 19:03:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 19:03:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 19:03:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 19:03:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 19:03:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 19:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 19:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 19:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 19:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 19:03:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 19:03:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 19:03:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 19:03:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 19:03:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 19:03:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 19:03:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 19:03:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 19:03:05,310 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 19:03:05,310 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 19:03:05,310 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 19:03:05,310 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 19:03:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 19:03:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 19:03:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 19:03:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 19:03:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 19:03:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 19:03:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 19:03:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 19:03:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 19:03:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 19:03:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 19:03:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 19:03:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 19:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 19:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 19:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 19:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 19:03:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 19:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 19:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 19:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 19:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 19:03:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 19:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 19:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 19:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 19:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 19:03:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 19:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 19:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 19:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 19:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 19:03:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 19:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 19:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 19:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 19:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 19:03:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 19:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 19:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 19:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 19:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 19:03:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 19:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 19:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 19:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 19:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 19:03:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 19:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 19:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 19:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 19:03:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 19:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 19:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 19:03:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 19:03:06,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 19:03:06,240 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 19:03:06,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:03:06 BoogieIcfgContainer [2019-11-20 19:03:06,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 19:03:06,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 19:03:06,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 19:03:06,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 19:03:06,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:03:04" (1/3) ... [2019-11-20 19:03:06,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beaa91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:03:06, skipping insertion in model container [2019-11-20 19:03:06,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:03:05" (2/3) ... [2019-11-20 19:03:06,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beaa91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:03:06, skipping insertion in model container [2019-11-20 19:03:06,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:03:06" (3/3) ... [2019-11-20 19:03:06,256 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-20 19:03:06,267 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 19:03:06,276 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 19:03:06,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 19:03:06,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 19:03:06,306 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 19:03:06,306 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 19:03:06,306 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 19:03:06,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 19:03:06,307 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 19:03:06,308 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 19:03:06,308 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 19:03:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 19:03:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 19:03:06,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:06,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:06,344 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 19:03:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 19:03:06,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:06,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1933573956] [2019-11-20 19:03:06,364 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 19:03:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:06,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 19:03:06,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:06,603 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 19:03:06,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:06,618 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 19:03:06,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1933573956] [2019-11-20 19:03:06,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:06,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 19:03:06,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38739042] [2019-11-20 19:03:06,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 19:03:06,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 19:03:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 19:03:06,647 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 19:03:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:06,672 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 19:03:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 19:03:06,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 19:03:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:06,686 INFO L225 Difference]: With dead ends: 110 [2019-11-20 19:03:06,686 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 19:03:06,688 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 19:03:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 19:03:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 19:03:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 19:03:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 19:03:06,740 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 19:03:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:06,740 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 19:03:06,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 19:03:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 19:03:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 19:03:06,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:06,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:06,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:06,947 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 19:03:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 19:03:06,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:06,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [965155429] [2019-11-20 19:03:06,953 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 19:03:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:07,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:03:07,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:07,219 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 19:03:07,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:07,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:07,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:07,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:03:07,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:07,286 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 19:03:07,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:07,309 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 19:03:07,310 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 19:03:07,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 19:03:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:07,333 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:07,358 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 19:03:07,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [965155429] [2019-11-20 19:03:07,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:07,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:03:07,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614709112] [2019-11-20 19:03:07,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:03:07,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:03:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:03:07,361 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 19:03:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:07,962 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 19:03:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:03:07,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 19:03:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:07,969 INFO L225 Difference]: With dead ends: 116 [2019-11-20 19:03:07,969 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 19:03:07,972 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 19:03:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 19:03:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 19:03:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 19:03:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 19:03:08,018 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 19:03:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:08,018 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 19:03:08,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:03:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 19:03:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 19:03:08,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:08,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:08,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:08,223 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 19:03:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 19:03:08,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [697906973] [2019-11-20 19:03:08,224 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 19:03:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:08,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 19:03:08,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:08,486 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 19:03:08,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:08,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:08,501 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 19:03:08,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:08,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:08,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:08,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:03:08,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:03:08,563 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 19:03:08,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:08,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:08,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:03:08,590 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 19:03:08,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:08,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:08,604 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 19:03:08,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-20 19:03:08,639 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 19:03:08,639 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:08,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:03:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:09,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697906973] [2019-11-20 19:03:09,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:09,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 19:03:09,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463362840] [2019-11-20 19:03:09,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 19:03:09,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 19:03:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 19:03:09,019 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 19:03:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:12,707 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 19:03:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 19:03:12,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 19:03:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:12,711 INFO L225 Difference]: With dead ends: 115 [2019-11-20 19:03:12,711 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 19:03:12,712 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 19:03:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 19:03:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 19:03:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 19:03:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 19:03:12,722 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 19:03:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:12,722 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 19:03:12,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 19:03:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 19:03:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 19:03:12,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:12,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:12,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:12,931 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 19:03:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 19:03:12,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:12,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [370614991] [2019-11-20 19:03:12,933 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 19:03:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:13,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:03:13,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:13,141 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 19:03:13,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:13,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:13,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:13,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:03:13,163 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 19:03:13,164 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:13,184 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 19:03:13,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [370614991] [2019-11-20 19:03:13,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:13,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 19:03:13,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671369839] [2019-11-20 19:03:13,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:03:13,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:03:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:03:13,187 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 19:03:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:13,385 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 19:03:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:03:13,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 19:03:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:13,389 INFO L225 Difference]: With dead ends: 108 [2019-11-20 19:03:13,389 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 19:03:13,389 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 19:03:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 19:03:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 19:03:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 19:03:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 19:03:13,397 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 19:03:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:13,397 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 19:03:13,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:03:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 19:03:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 19:03:13,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:13,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:13,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:13,602 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 19:03:13,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 19:03:13,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1518853057] [2019-11-20 19:03:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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 19:03:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:13,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:03:13,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:13,795 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 19:03:13,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:13,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:13,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:13,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:03:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:13,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:13,869 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 19:03:13,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1518853057] [2019-11-20 19:03:13,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:13,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 19:03:13,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740755692] [2019-11-20 19:03:13,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:03:13,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:03:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:03:13,873 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 19:03:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:14,229 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 19:03:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:03:14,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 19:03:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:14,231 INFO L225 Difference]: With dead ends: 107 [2019-11-20 19:03:14,231 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 19:03:14,231 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 19:03:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 19:03:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 19:03:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 19:03:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 19:03:14,239 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 19:03:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:14,240 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 19:03:14,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:03:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 19:03:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 19:03:14,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:14,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:14,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:14,444 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 19:03:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 19:03:14,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:14,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [279685273] [2019-11-20 19:03:14,445 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 19:03:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:14,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:03:14,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:14,637 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 19:03:14,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:14,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:14,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:14,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:03:14,642 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 19:03:14,643 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:14,651 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 19:03:14,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [279685273] [2019-11-20 19:03:14,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:14,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 19:03:14,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776562976] [2019-11-20 19:03:14,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 19:03:14,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:14,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 19:03:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 19:03:14,653 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 19:03:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:14,835 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 19:03:14,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:03:14,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 19:03:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:14,837 INFO L225 Difference]: With dead ends: 105 [2019-11-20 19:03:14,837 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 19:03:14,838 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 19:03:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 19:03:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 19:03:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 19:03:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 19:03:14,845 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 19:03:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:14,846 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 19:03:14,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 19:03:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 19:03:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 19:03:14,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:14,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:15,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:15,048 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 19:03:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 19:03:15,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:15,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1733296209] [2019-11-20 19:03:15,049 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 19:03:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:15,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:03:15,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:15,255 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 19:03:15,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:15,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:15,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:15,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:03:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:15,269 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:15,300 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 19:03:15,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1733296209] [2019-11-20 19:03:15,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:15,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 19:03:15,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327654303] [2019-11-20 19:03:15,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:03:15,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:15,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:03:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:03:15,301 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 19:03:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:15,616 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 19:03:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 19:03:15,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 19:03:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:15,618 INFO L225 Difference]: With dead ends: 106 [2019-11-20 19:03:15,619 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 19:03:15,620 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 19:03:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 19:03:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 19:03:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 19:03:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 19:03:15,628 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 19:03:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:15,628 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 19:03:15,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:03:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 19:03:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 19:03:15,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:15,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:15,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:15,835 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 19:03:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 19:03:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [852776278] [2019-11-20 19:03:15,836 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 19:03:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:16,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 19:03:16,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:16,028 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 19:03:16,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:16,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:16,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:16,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:03:16,049 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 19:03:16,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:16,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852776278] [2019-11-20 19:03:16,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:16,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 19:03:16,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681038102] [2019-11-20 19:03:16,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 19:03:16,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 19:03:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:03:16,114 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 19:03:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:16,654 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 19:03:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:03:16,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 19:03:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:16,657 INFO L225 Difference]: With dead ends: 135 [2019-11-20 19:03:16,658 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 19:03:16,658 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 19:03:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 19:03:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 19:03:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 19:03:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 19:03:16,664 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 19:03:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:16,664 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 19:03:16,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 19:03:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 19:03:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 19:03:16,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:16,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:03:16,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:16,868 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 19:03:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 19:03:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1317424340] [2019-11-20 19:03:16,870 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 19:03:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:17,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:03:17,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:17,061 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 19:03:17,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:17,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:17,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:17,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:03:17,091 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 19:03:17,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:17,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:03:17,230 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 19:03:17,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1317424340] [2019-11-20 19:03:17,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:17,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 19:03:17,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422877037] [2019-11-20 19:03:17,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 19:03:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 19:03:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:03:17,233 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 19:03:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:17,838 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 19:03:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:03:17,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 19:03:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:17,842 INFO L225 Difference]: With dead ends: 109 [2019-11-20 19:03:17,842 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 19:03:17,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:03:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 19:03:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 19:03:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 19:03:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 19:03:17,848 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 19:03:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:17,849 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 19:03:17,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 19:03:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 19:03:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:03:17,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:17,850 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 19:03:18,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:18,051 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 19:03:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 19:03:18,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:18,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [202012637] [2019-11-20 19:03:18,053 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 19:03:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:18,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:03:18,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:18,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:18,306 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 19:03:18,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [202012637] [2019-11-20 19:03:18,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:18,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 19:03:18,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632797285] [2019-11-20 19:03:18,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:03:18,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:03:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:03:18,308 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 19:03:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:18,745 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 19:03:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:03:18,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 19:03:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:18,747 INFO L225 Difference]: With dead ends: 135 [2019-11-20 19:03:18,747 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 19:03:18,748 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 19:03:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 19:03:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 19:03:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 19:03:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 19:03:18,753 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 19:03:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 19:03:18,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:03:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 19:03:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:03:18,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:18,755 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 19:03:18,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:18,965 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 19:03:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 19:03:18,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:18,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [830809200] [2019-11-20 19:03: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 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 19:03:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:19,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 19:03:19,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:19,246 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 19:03:19,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:19,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:03:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:03:19,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [830809200] [2019-11-20 19:03:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:19,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 19:03:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015941291] [2019-11-20 19:03:19,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 19:03:19,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 19:03:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 19:03:19,336 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 19:03:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:20,296 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 19:03:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 19:03:20,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 19:03:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:20,298 INFO L225 Difference]: With dead ends: 104 [2019-11-20 19:03:20,299 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 19:03:20,299 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 19:03:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 19:03:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 19:03:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 19:03:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 19:03:20,303 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 19:03:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:20,303 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 19:03:20,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 19:03:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 19:03:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:03:20,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:20,304 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 19:03:20,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:20,511 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 19:03:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 19:03:20,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:20,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2015203140] [2019-11-20 19:03:20,512 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 19:03:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:20,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 19:03:20,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:20,717 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 19:03:20,718 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03: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 19:03:20,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2015203140] [2019-11-20 19:03:20,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:20,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 19:03:20,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641027332] [2019-11-20 19:03:20,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:03:20,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:20,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:03:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:03:20,736 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 19:03:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:20,776 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 19:03:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 19:03:20,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 19:03:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:20,779 INFO L225 Difference]: With dead ends: 112 [2019-11-20 19:03:20,780 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 19:03:20,780 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 19:03:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 19:03:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 19:03:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:03:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 19:03:20,785 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 19:03:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:20,785 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 19:03:20,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:03:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 19:03:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 19:03:20,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:20,791 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 19:03:20,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:20,995 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 19:03:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 19:03:20,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:20,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2033602233] [2019-11-20 19:03:20,997 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 19:03:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:21,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:03:21,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:21,214 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 19:03:21,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:21,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:21,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:21,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:03:21,229 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 19:03:21,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:21,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:21,242 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 19:03:21,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 19:03:21,263 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 19:03:21,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:21,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:21,268 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 19:03:21,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 19:03:21,278 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 19:03:21,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:21,298 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 19:03:21,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033602233] [2019-11-20 19:03:21,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:21,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:03:21,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479700676] [2019-11-20 19:03:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:03:21,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:03:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:03:21,300 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 19:03:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:21,704 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 19:03:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:03:21,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 19:03:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:21,706 INFO L225 Difference]: With dead ends: 114 [2019-11-20 19:03:21,706 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 19:03:21,707 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 19:03:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 19:03:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 19:03:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:03:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 19:03:21,711 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 19:03:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:21,711 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 19:03:21,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:03:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 19:03:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 19:03:21,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:21,712 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 19:03:21,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:21,915 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 19:03:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 19:03:21,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:21,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [756919526] [2019-11-20 19:03:21,917 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 19:03:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:22,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 19:03:22,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:22,136 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 19:03:22,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:22,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:03:22,162 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 19:03:22,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:22,186 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 19:03:22,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:22,197 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 19:03:22,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-20 19:03:22,239 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 19:03:22,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:22,258 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 19:03:22,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:22,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:22,267 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 19:03:22,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-20 19:03:22,284 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 19:03:22,284 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:22,582 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 19:03:22,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756919526] [2019-11-20 19:03:22,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:22,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:03:22,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105703470] [2019-11-20 19:03:22,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:03:22,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:03:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 19:03:22,583 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 19:03:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:03:24,230 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 19:03:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 19:03:24,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 19:03:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:03:24,232 INFO L225 Difference]: With dead ends: 113 [2019-11-20 19:03:24,232 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 19:03:24,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 19:03:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 19:03:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 19:03:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:03:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 19:03:24,239 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 19:03:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:03:24,240 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 19:03:24,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:03:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 19:03:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 19:03:24,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:03:24,243 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 19:03:24,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:03:24,444 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 19:03:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:03:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 19:03:24,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:03:24,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1802102453] [2019-11-20 19:03:24,445 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 19:03:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:03:24,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 19:03:24,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:03:24,693 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 19:03:24,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:24,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:24,707 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 19:03:24,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:24,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:24,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:03:24,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:03:24,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:03:24,765 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 19:03:24,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:24,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:24,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:03:24,782 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 19:03:24,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:03:24,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:03:24,794 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 19:03:24,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-20 19:03:24,817 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 19:03:24,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:03:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:03:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:03:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:25,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:25,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:25,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:28,749 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 19:03:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:03:31,362 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 19:03:31,524 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 19:03:31,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1802102453] [2019-11-20 19:03:31,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:03:31,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:03:31,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040845860] [2019-11-20 19:03:31,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:03:31,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:03:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:03:31,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 19:03:31,526 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 19:03:38,535 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-20 19:03:44,654 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 19:04:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:04:01,895 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-20 19:04:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 19:04:01,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 19:04:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:04:01,898 INFO L225 Difference]: With dead ends: 129 [2019-11-20 19:04:01,898 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 19:04:01,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=46, Invalid=111, Unknown=3, NotChecked=22, Total=182 [2019-11-20 19:04:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 19:04:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-20 19:04:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 19:04:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 19:04:01,904 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 19:04:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:04:01,905 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 19:04:01,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:04:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 19:04:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:04:01,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:04:01,906 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 19:04:02,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:04:02,110 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 19:04:02,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:04:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 19:04:02,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:04:02,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [571132278] [2019-11-20 19:04:02,112 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 19:04:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:04:02,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:04:02,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:04:02,366 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 19:04:02,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:02,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 19:04:02,382 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 19:04:02,382 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:04:02,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:02,433 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 19:04:02,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:02,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:02,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 19:04:02,443 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 19:04:02,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:02,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:04:02,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 19:04:02,450 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 19:04:02,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [571132278] [2019-11-20 19:04:02,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:04:02,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:04:02,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877497164] [2019-11-20 19:04:02,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:04:02,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:04:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:04:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:04:02,452 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 19:04:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:04:02,734 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 19:04:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:04:02,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 19:04:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:04:02,736 INFO L225 Difference]: With dead ends: 112 [2019-11-20 19:04:02,736 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 19:04:02,736 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 19:04:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 19:04:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 19:04:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 19:04:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 19:04:02,740 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 19:04:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:04:02,741 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 19:04:02,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:04:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 19:04:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:04:02,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:04:02,742 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 19:04:02,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:04:02,945 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 19:04:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:04:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 19:04:02,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:04:02,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [952470004] [2019-11-20 19:04:02,946 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 19:04:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:04:03,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:04:03,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:04:03,222 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 19:04:03,222 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:04:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:04:03,354 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 19:04:03,355 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 19:04:03,363 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 19:04:03,364 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 19:04:03,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:03,392 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 19:04:03,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 19:04:03,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:03,529 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 19:04:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,531 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 19:04:03,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,570 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 19:04:03,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 19:04:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:04,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:04,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 19:04:04,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [952470004] [2019-11-20 19:04:04,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:04:04,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:04:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233031472] [2019-11-20 19:04:04,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:04:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:04:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:04:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 19:04:04,273 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 19:04:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:04:04,722 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 19:04:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:04:04,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 19:04:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:04:04,725 INFO L225 Difference]: With dead ends: 106 [2019-11-20 19:04:04,725 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 19:04:04,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 19:04:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 19:04:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 19:04:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 19:04:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 19:04:04,737 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 19:04:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:04:04,737 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 19:04:04,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:04:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 19:04:04,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:04:04,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:04:04,741 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 19:04:04,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:04:04,946 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 19:04:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:04:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 19:04:04,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:04:04,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482660169] [2019-11-20 19:04:04,946 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 19:04:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:04:05,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 19:04:05,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:04:05,203 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 19:04:05,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,216 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 19:04:05,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:04:05,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,276 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 19:04:05,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,294 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 19:04:05,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,315 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 19:04:05,316 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 19:04:05,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 19:04:05,448 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 19:04:05,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,465 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 19:04:05,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:05,512 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 19:04:05,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:05,551 INFO L567 ElimStorePlain]: treesize reduction 18, result has 58.1 percent of original size [2019-11-20 19:04:05,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,553 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 19:04:05,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:25 [2019-11-20 19:04:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,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 19:04:05,649 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:04:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:04:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:04:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:04:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:10,825 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 19:04:10,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:04:11,285 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 19:04:11,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:04:11,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:11,473 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 19:04:11,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:04:11,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:04:11,496 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 19:04:11,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 19:04:11,861 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 19:04:11,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482660169] [2019-11-20 19:04:11,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:04:11,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 19:04:11,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007808699] [2019-11-20 19:04:11,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 19:04:11,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:04:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 19:04:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-11-20 19:04:11,867 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 16 states. [2019-11-20 19:04:20,664 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 19:04:28,874 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 19:04:46,986 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 19:05:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:05:02,238 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-20 19:05:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 19:05:02,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-20 19:05:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:05:02,240 INFO L225 Difference]: With dead ends: 128 [2019-11-20 19:05:02,240 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 19:05:02,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=4, NotChecked=36, Total=420 [2019-11-20 19:05:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 19:05:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2019-11-20 19:05:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 19:05:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-20 19:05:02,246 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 22 [2019-11-20 19:05:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:05:02,246 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-20 19:05:02,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 19:05:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-20 19:05:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 19:05:02,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:05:02,247 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 19:05:02,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:05:02,450 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 19:05:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:05:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-20 19:05:02,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:05:02,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1051205881] [2019-11-20 19:05:02,452 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 19:05:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:05:02,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 19:05:02,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:05:02,682 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 19:05:02,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,693 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 19:05:02,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:05:02,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,793 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 19:05:02,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,816 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 19:05:02,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,838 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 19:05:02,838 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 19:05:02,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 19:05:02,891 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-20 19:05:02,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,905 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 19:05:02,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:02,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:02,973 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 19:05:02,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:03,006 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 19:05:03,007 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 19:05:03,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-20 19:05:03,079 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 19:05:03,079 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:05:03,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:05:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:05:03,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:03,501 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 19:05:03,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:03,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:03,526 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 19:05:03,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:03,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:03,548 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 19:05:03,548 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 19:05:03,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:05:03,601 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 19:05:03,601 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-20 19:05:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:05:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:05:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:03,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 19:05:03,722 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 19:05:05,199 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 19:05:05,205 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:05:05,212 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:05:05,223 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:05:05,227 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:05:05,248 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:05:05,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:05,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:05:05,266 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-11-20 19:05:05,324 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-20 19:05:05,328 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-20 19:05:05,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:05:05,534 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 19:05:05,544 INFO L168 Benchmark]: Toolchain (without parser) took 121010.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -202.7 MB). Peak memory consumption was 74.2 MB. Max. memory is 11.5 GB. [2019-11-20 19:05:05,544 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 19:05:05,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-20 19:05:05,545 INFO L168 Benchmark]: Boogie Preprocessor took 91.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 19:05:05,546 INFO L168 Benchmark]: RCFGBuilder took 1014.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-20 19:05:05,546 INFO L168 Benchmark]: TraceAbstraction took 119296.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-20 19:05:05,549 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1014.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119296.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 26.7 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...