./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 14:42:33,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 14:42:33,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 14:42:33,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 14:42:33,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 14:42:33,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 14:42:33,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 14:42:33,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 14:42:33,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 14:42:33,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 14:42:33,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 14:42:33,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 14:42:33,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 14:42:33,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 14:42:33,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 14:42:33,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 14:42:33,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 14:42:33,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 14:42:33,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 14:42:33,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 14:42:33,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 14:42:33,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 14:42:33,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 14:42:33,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 14:42:33,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 14:42:33,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 14:42:33,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 14:42:33,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 14:42:33,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 14:42:33,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 14:42:33,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 14:42:33,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 14:42:33,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 14:42:33,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 14:42:33,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 14:42:33,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 14:42:33,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 14:42:33,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 14:42:33,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 14:42:33,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 14:42:33,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 14:42:33,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 14:42:33,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 14:42:33,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 14:42:33,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 14:42:33,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 14:42:33,615 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 14:42:33,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 14:42:33,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 14:42:33,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 14:42:33,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 14:42:33,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 14:42:33,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 14:42:33,617 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 14:42:33,617 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 14:42:33,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 14:42:33,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 14:42:33,618 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 14:42:33,618 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 14:42:33,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 14:42:33,618 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 14:42:33,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 14:42:33,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 14:42:33,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 14:42:33,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 14:42:33,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:42:33,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 14:42:33,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 14:42:33,620 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 14:42:33,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 14:42:33,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 14:42:33,621 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-21 14:42:33,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 14:42:33,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 14:42:33,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 14:42:33,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 14:42:33,954 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 14:42:33,955 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-21 14:42:34,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c596daa3b/7cf6009656df4a969f52af5a995e86e6/FLAG3ca8b00e8 [2019-11-21 14:42:34,561 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 14:42:34,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 14:42:34,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c596daa3b/7cf6009656df4a969f52af5a995e86e6/FLAG3ca8b00e8 [2019-11-21 14:42:34,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c596daa3b/7cf6009656df4a969f52af5a995e86e6 [2019-11-21 14:42:34,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 14:42:34,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 14:42:34,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 14:42:34,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 14:42:34,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 14:42:34,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:42:34" (1/1) ... [2019-11-21 14:42:34,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5eb229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:34, skipping insertion in model container [2019-11-21 14:42:34,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:42:34" (1/1) ... [2019-11-21 14:42:34,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 14:42:34,917 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 14:42:35,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:42:35,342 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 14:42:35,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:42:35,454 INFO L205 MainTranslator]: Completed translation [2019-11-21 14:42:35,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35 WrapperNode [2019-11-21 14:42:35,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 14:42:35,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 14:42:35,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 14:42:35,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 14:42:35,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... [2019-11-21 14:42:35,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 14:42:35,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 14:42:35,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 14:42:35,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 14:42:35,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:42:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 14:42:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 14:42:35,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 14:42:35,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 14:42:35,600 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 14:42:35,601 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 14:42:35,601 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 14:42:35,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 14:42:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 14:42:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 14:42:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 14:42:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 14:42:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 14:42:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 14:42:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 14:42:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 14:42:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 14:42:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 14:42:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 14:42:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 14:42:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 14:42:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 14:42:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 14:42:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 14:42:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 14:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 14:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 14:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 14:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 14:42:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 14:42:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 14:42:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 14:42:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 14:42:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 14:42:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 14:42:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 14:42:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 14:42:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 14:42:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 14:42:35,612 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 14:42:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 14:42:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 14:42:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 14:42:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 14:42:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 14:42:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 14:42:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 14:42:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 14:42:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 14:42:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 14:42:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 14:42:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 14:42:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 14:42:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 14:42:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 14:42:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 14:42:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 14:42:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 14:42:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 14:42:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 14:42:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 14:42:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 14:42:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 14:42:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 14:42:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 14:42:35,620 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 14:42:35,620 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 14:42:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 14:42:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 14:42:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 14:42:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 14:42:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 14:42:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 14:42:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 14:42:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 14:42:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 14:42:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 14:42:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 14:42:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 14:42:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 14:42:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 14:42:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 14:42:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 14:42:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 14:42:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 14:42:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 14:42:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 14:42:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 14:42:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 14:42:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 14:42:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 14:42:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 14:42:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 14:42:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 14:42:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 14:42:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 14:42:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 14:42:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 14:42:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 14:42:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 14:42:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 14:42:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 14:42:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 14:42:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 14:42:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 14:42:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 14:42:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 14:42:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 14:42:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 14:42:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 14:42:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 14:42:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 14:42:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 14:42:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 14:42:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 14:42:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 14:42:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 14:42:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 14:42:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 14:42:36,495 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 14:42:36,495 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 14:42:36,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:42:36 BoogieIcfgContainer [2019-11-21 14:42:36,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 14:42:36,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 14:42:36,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 14:42:36,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 14:42:36,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:42:34" (1/3) ... [2019-11-21 14:42:36,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf9f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:42:36, skipping insertion in model container [2019-11-21 14:42:36,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:42:35" (2/3) ... [2019-11-21 14:42:36,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf9f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:42:36, skipping insertion in model container [2019-11-21 14:42:36,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:42:36" (3/3) ... [2019-11-21 14:42:36,506 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-21 14:42:36,516 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 14:42:36,525 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 14:42:36,537 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 14:42:36,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 14:42:36,562 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 14:42:36,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 14:42:36,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 14:42:36,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 14:42:36,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 14:42:36,564 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 14:42:36,564 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 14:42:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 14:42:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 14:42:36,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:36,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:36,601 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-21 14:42:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 14:42:36,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:36,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950017303] [2019-11-21 14:42:36,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:36,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 14:42:36,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:36,868 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950017303] [2019-11-21 14:42:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 14:42:36,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853860222] [2019-11-21 14:42:36,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 14:42:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 14:42:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 14:42:36,917 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 14:42:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:36,945 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 14:42:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 14:42:36,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 14:42:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:36,959 INFO L225 Difference]: With dead ends: 110 [2019-11-21 14:42:36,959 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:42:36,961 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-21 14:42:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:42:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 14:42:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 14:42:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 14:42:37,011 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 14:42:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:37,011 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 14:42:37,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 14:42:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 14:42:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 14:42:37,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:37,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:37,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:37,218 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-21 14:42:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 14:42:37,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:37,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1144025261] [2019-11-21 14:42:37,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:37,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:42:37,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:37,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:37,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:37,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:37,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:37,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:42:37,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:37,542 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-21 14:42:37,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:37,565 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 14:42:37,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:42:37,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 14:42:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:37,585 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:37,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1144025261] [2019-11-21 14:42:37,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:37,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:42:37,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478566660] [2019-11-21 14:42:37,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:42:37,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:42:37,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:42:37,617 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 14:42:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:38,173 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 14:42:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:42:38,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 14:42:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:38,180 INFO L225 Difference]: With dead ends: 116 [2019-11-21 14:42:38,180 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 14:42:38,181 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-21 14:42:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 14:42:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 14:42:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 14:42:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 14:42:38,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 14:42:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:38,200 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 14:42:38,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:42:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 14:42:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 14:42:38,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:38,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:38,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:38,405 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-21 14:42:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 14:42:38,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:38,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [254827810] [2019-11-21 14:42:38,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:38,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 14:42:38,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:38,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:38,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:38,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:38,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:38,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:38,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:38,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:38,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:42:38,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:42:38,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 14:42:38,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:38,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:38,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:42:38,776 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-21 14:42:38,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:38,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:38,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:42:38,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 14:42:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:38,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:38,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:39,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254827810] [2019-11-21 14:42:39,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:39,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 14:42:39,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878659450] [2019-11-21 14:42:39,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 14:42:39,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 14:42:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 14:42:39,137 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 14:42:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:43,027 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 14:42:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:42:43,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 14:42:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:43,031 INFO L225 Difference]: With dead ends: 115 [2019-11-21 14:42:43,031 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 14:42:43,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-21 14:42:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 14:42:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 14:42:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 14:42:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 14:42:43,043 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 14:42:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:43,043 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 14:42:43,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 14:42:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 14:42:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:42:43,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:43,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:43,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:43,249 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-21 14:42:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 14:42:43,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:43,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2067978990] [2019-11-21 14:42:43,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:43,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:42:43,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:43,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:43,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:43,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:43,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:43,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:42:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:43,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:43,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2067978990] [2019-11-21 14:42:43,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:43,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 14:42:43,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823215315] [2019-11-21 14:42:43,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:42:43,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:42:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:42:43,496 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 14:42:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:43,653 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 14:42:43,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:42:43,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:42:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:43,654 INFO L225 Difference]: With dead ends: 108 [2019-11-21 14:42:43,654 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 14:42:43,655 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-21 14:42:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 14:42:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 14:42:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 14:42:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 14:42:43,663 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 14:42:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:43,664 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 14:42:43,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:42:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 14:42:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:42:43,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:43,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:43,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:43,868 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-21 14:42:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 14:42:43,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:43,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1767317764] [2019-11-21 14:42:43,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:42:44,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:44,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:44,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:44,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:44,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:44,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:42:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:44,062 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:44,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1767317764] [2019-11-21 14:42:44,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:44,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 14:42:44,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690272310] [2019-11-21 14:42:44,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:42:44,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:42:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:42:44,092 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 14:42:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:44,502 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 14:42:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:42:44,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:42:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:44,504 INFO L225 Difference]: With dead ends: 107 [2019-11-21 14:42:44,505 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:42:44,505 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-21 14:42:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:42:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 14:42:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 14:42:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 14:42:44,514 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 14:42:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:44,514 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 14:42:44,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:42:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 14:42:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 14:42:44,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:44,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:44,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:44,723 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-21 14:42:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 14:42:44,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:44,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [547545118] [2019-11-21 14:42:44,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:44,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:42:44,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:44,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:44,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:44,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:44,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:44,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:42:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:44,923 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:44,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [547545118] [2019-11-21 14:42:44,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:44,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 14:42:44,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105709734] [2019-11-21 14:42:44,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 14:42:44,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 14:42:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 14:42:44,931 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 14:42:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:45,086 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 14:42:45,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:42:45,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 14:42:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:45,087 INFO L225 Difference]: With dead ends: 105 [2019-11-21 14:42:45,088 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 14:42:45,088 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-21 14:42:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 14:42:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 14:42:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 14:42:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 14:42:45,095 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 14:42:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:45,095 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 14:42:45,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 14:42:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 14:42:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 14:42:45,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:45,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:45,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:45,304 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-21 14:42:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:45,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 14:42:45,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:45,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985500213] [2019-11-21 14:42:45,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:45,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:42:45,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:45,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:45,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:45,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:45,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:45,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:42:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:45,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:45,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985500213] [2019-11-21 14:42:45,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:45,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 14:42:45,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333375490] [2019-11-21 14:42:45,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:42:45,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:42:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:42:45,575 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 14:42:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:45,898 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 14:42:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:42:45,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 14:42:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:45,900 INFO L225 Difference]: With dead ends: 106 [2019-11-21 14:42:45,900 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 14:42:45,900 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-21 14:42:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 14:42:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 14:42:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 14:42:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 14:42:45,907 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 14:42:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:45,908 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 14:42:45,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:42:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 14:42:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 14:42:45,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:45,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:46,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:46,112 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-21 14:42:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 14:42:46,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:46,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [858509932] [2019-11-21 14:42:46,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:46,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 14:42:46,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:46,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:46,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:46,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:46,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:46,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:42:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:46,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:46,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [858509932] [2019-11-21 14:42:46,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:46,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 14:42:46,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691130294] [2019-11-21 14:42:46,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:42:46,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:42:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:42:46,393 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 14:42:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:46,958 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 14:42:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:42:46,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 14:42:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:46,964 INFO L225 Difference]: With dead ends: 135 [2019-11-21 14:42:46,965 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 14:42:46,965 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-21 14:42:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 14:42:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 14:42:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 14:42:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 14:42:46,971 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 14:42:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:46,972 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 14:42:46,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:42:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 14:42:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 14:42:46,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:46,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:47,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:47,182 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-21 14:42:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 14:42:47,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:47,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1157688037] [2019-11-21 14:42:47,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:47,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:42:47,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:47,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:47,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:47,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:47,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:47,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:42:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:47,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:47,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:47,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1157688037] [2019-11-21 14:42:47,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:47,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 14:42:47,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913475325] [2019-11-21 14:42:47,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:42:47,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:42:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:42:47,505 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 14:42:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:48,096 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 14:42:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:42:48,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 14:42:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:48,101 INFO L225 Difference]: With dead ends: 109 [2019-11-21 14:42:48,101 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 14:42:48,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:42:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 14:42:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 14:42:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 14:42:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 14:42:48,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 14:42:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:48,107 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 14:42:48,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:42:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 14:42:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:42:48,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:48,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:48,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:48,312 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-21 14:42:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 14:42:48,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:48,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1557415863] [2019-11-21 14:42:48,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:48,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:42:48,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:48,529 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:48,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1557415863] [2019-11-21 14:42:48,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:48,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:42:48,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852653312] [2019-11-21 14:42:48,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:42:48,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:42:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:42:48,579 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 14:42:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:48,990 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 14:42:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:42:48,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 14:42:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:48,993 INFO L225 Difference]: With dead ends: 135 [2019-11-21 14:42:48,993 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 14:42:48,993 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-21 14:42:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 14:42:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 14:42:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 14:42:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 14:42:48,999 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 14:42:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:49,000 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 14:42:49,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:42:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 14:42:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:42:49,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:49,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:49,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:49,205 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-21 14:42:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 14:42:49,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:49,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1902373699] [2019-11-21 14:42:49,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:49,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 14:42:49,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:49,496 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:49,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:49,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1902373699] [2019-11-21 14:42:49,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:49,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 14:42:49,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307049497] [2019-11-21 14:42:49,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 14:42:49,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 14:42:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 14:42:49,615 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 14:42:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:50,654 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 14:42:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:42:50,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 14:42:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:50,657 INFO L225 Difference]: With dead ends: 104 [2019-11-21 14:42:50,657 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 14:42:50,658 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-21 14:42:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 14:42:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 14:42:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 14:42:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 14:42:50,662 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 14:42:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:50,662 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 14:42:50,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 14:42:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 14:42:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:42:50,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:50,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:42:50,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:50,864 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-21 14:42:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:50,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 14:42:50,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:50,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349788823] [2019-11-21 14:42:50,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:51,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:42:51,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:51,081 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349788823] [2019-11-21 14:42:51,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:51,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:42:51,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857474802] [2019-11-21 14:42:51,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:42:51,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:42:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:42:51,101 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 14:42:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:51,142 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 14:42:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:42:51,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 14:42:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:51,145 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:42:51,145 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 14:42:51,146 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-21 14:42:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 14:42:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 14:42:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:42:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 14:42:51,150 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 14:42:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:51,150 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 14:42:51,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:42:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 14:42:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:42:51,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:51,151 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-21 14:42:51,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:51,354 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-21 14:42:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 14:42:51,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:51,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [770556528] [2019-11-21 14:42:51,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:51,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:42:51,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:51,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:51,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:51,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:51,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:51,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:42:51,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:42:51,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:51,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:51,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:51,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 14:42:51,646 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-21 14:42:51,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:51,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:51,652 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-21 14:42:51,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 14:42:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:51,665 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:51,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [770556528] [2019-11-21 14:42:51,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:51,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:42:51,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479604625] [2019-11-21 14:42:51,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:42:51,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:42:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:42:51,683 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 14:42:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:52,083 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-21 14:42:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:42:52,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 14:42:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:52,085 INFO L225 Difference]: With dead ends: 114 [2019-11-21 14:42:52,085 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 14:42:52,086 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-21 14:42:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 14:42:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-21 14:42:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:42:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-21 14:42:52,090 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-21 14:42:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:52,090 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-21 14:42:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:42:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-21 14:42:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:42:52,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:52,091 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-21 14:42:52,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:52,294 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-21 14:42:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 14:42:52,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:52,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [603489599] [2019-11-21 14:42:52,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:52,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 14:42:52,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:52,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:52,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:52,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:42:52,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:42:52,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:52,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 14:42:52,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:52,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 14:42:52,629 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-21 14:42:52,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:52,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-21 14:42:52,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:52,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:52,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 14:42:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:52,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:52,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603489599] [2019-11-21 14:42:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:42:52,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:42:52,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931061927] [2019-11-21 14:42:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:42:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:42:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:42:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:42:53,000 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-21 14:42:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:42:54,631 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 14:42:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 14:42:54,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 14:42:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:42:54,634 INFO L225 Difference]: With dead ends: 113 [2019-11-21 14:42:54,634 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 14:42:54,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-21 14:42:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 14:42:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-21 14:42:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 14:42:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-21 14:42:54,638 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-21 14:42:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:42:54,639 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-21 14:42:54,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:42:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-21 14:42:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:42:54,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:42:54,640 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-21 14:42:54,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:42:54,843 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-21 14:42:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:42:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 14:42:54,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:42:54,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [432359544] [2019-11-21 14:42:54,845 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-21 14:42:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:42:55,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 14:42:55,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:42:55,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:55,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:55,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:55,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:42:55,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:55,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:55,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:42:55,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:42:55,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:42:55,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 14:42:55,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:55,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:55,197 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:55,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 14:42:55,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:42:55,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:42:55,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:42:55,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-21 14:42:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:42:55,237 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:42:55,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:42:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:42:55,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:42:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:42:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:42:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:42:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:00,049 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 14:43:00,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:02,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432359544] [2019-11-21 14:43:02,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:43:02,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:43:02,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401919364] [2019-11-21 14:43:02,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:43:02,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:43:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:43:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 14:43:02,528 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-21 14:43:07,270 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (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 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-21 14:43:11,422 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (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 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|))))))) is different from false [2019-11-21 14:43:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:43:32,379 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-21 14:43:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 14:43:32,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 14:43:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:43:32,381 INFO L225 Difference]: With dead ends: 129 [2019-11-21 14:43:32,381 INFO L226 Difference]: Without dead ends: 129 [2019-11-21 14:43:32,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=3, NotChecked=42, Total=182 [2019-11-21 14:43:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-21 14:43:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-21 14:43:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 14:43:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-21 14:43:32,386 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-21 14:43:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:43:32,387 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-21 14:43:32,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:43:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-21 14:43:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:43:32,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:43:32,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:43:32,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:32,589 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-21 14:43:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:43:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 14:43:32,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:43:32,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1610035459] [2019-11-21 14:43:32,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:43:32,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:43:32,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:43:32,818 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-21 14:43:32,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:32,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 14:43:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:32,847 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:43:32,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:32,913 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-21 14:43:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:32,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:32,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 14:43:32,926 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-21 14:43:32,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:32,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:43:32,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 14:43:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:32,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1610035459] [2019-11-21 14:43:32,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:43:32,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:43:32,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467049195] [2019-11-21 14:43:32,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:43:32,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:43:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:43:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:43:32,935 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-21 14:43:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:43:33,218 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 14:43:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:43:33,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 14:43:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:43:33,221 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:43:33,221 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 14:43:33,221 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-21 14:43:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 14:43:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-21 14:43:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 14:43:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-21 14:43:33,225 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-21 14:43:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:43:33,226 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-21 14:43:33,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:43:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-21 14:43:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:43:33,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:43:33,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:43:33,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:33,430 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-21 14:43:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:43:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 14:43:33,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:43:33,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [826919707] [2019-11-21 14:43:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:43:33,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:43:33,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:43:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:33,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:43:33,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:33,889 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-21 14:43:33,890 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:43:33,897 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-21 14:43:33,898 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:43:33,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:33,923 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-21 14:43:33,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 14:43:34,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:34,076 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-21 14:43:34,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,079 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-21 14:43:34,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,116 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-21 14:43:34,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 14:43:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:34,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [826919707] [2019-11-21 14:43:34,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:43:34,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:43:34,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51549955] [2019-11-21 14:43:34,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:43:34,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:43:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:43:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:43:34,998 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-21 14:43:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:43:35,516 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-21 14:43:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:43:35,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 14:43:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:43:35,519 INFO L225 Difference]: With dead ends: 106 [2019-11-21 14:43:35,519 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 14:43:35,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 14:43:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 14:43:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-21 14:43:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 14:43:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-21 14:43:35,525 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-21 14:43:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:43:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-21 14:43:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:43:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-21 14:43:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 14:43:35,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:43:35,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:43:35,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:35,734 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-21 14:43:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:43:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 14:43:35,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:43:35,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [656596979] [2019-11-21 14:43:35,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:43:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:43:35,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 14:43:35,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:43:35,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:43:35,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:43:36,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:43:36,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,069 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-21 14:43:36,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 14:43:36,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,111 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 14:43:36,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:43:36,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 14:43:36,225 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 14:43:36,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 14:43:36,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:36,287 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-21 14:43:36,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:36,335 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-21 14:43:36,336 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-21 14:43:36,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-21 14:43:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:36,350 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:43:36,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:36,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:39,340 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 14:43:39,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:43:39,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:43:39,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:39,947 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-21 14:43:39,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:43:39,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:43:39,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:43:39,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 14:43:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 14:43:40,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656596979] [2019-11-21 14:43:40,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:43:40,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-21 14:43:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268573292] [2019-11-21 14:43:40,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 14:43:40,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:43:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 14:43:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-21 14:43:40,302 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-21 14:43:44,580 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (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 (_ bv4 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| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (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 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)))))))) (= (bvadd (select |c_#length| c_append_~pointerToList.base) (_ bv4294967292 32)) (_ bv0 32)) (exists ((|append_#t~malloc12.base| (_ BitVec 32))) (= (_ bv8 32) (select |c_#length| |append_#t~malloc12.base|))) (= (_ bv0 32) c_append_~pointerToList.offset) (= (bvadd (select |c_#valid| |c_append_#in~pointerToList.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv4 32) (select |c_#length| |c_append_#in~pointerToList.base|)) (= (_ bv0 32) |c_append_#in~pointerToList.offset|) (= (_ bv1 1) (select |c_#valid| c_append_~pointerToList.base))) is different from false [2019-11-21 14:43:48,950 WARN L838 $PredicateComparison]: unable to prove that (and (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| (_ bv8 32)) |c_#length|))) (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 (_ bv4 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| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (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 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10))))))))) is different from false [2019-11-21 14:44:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:44:02,159 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-11-21 14:44:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 14:44:02,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-21 14:44:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:44:02,161 INFO L225 Difference]: With dead ends: 126 [2019-11-21 14:44:02,161 INFO L226 Difference]: Without dead ends: 126 [2019-11-21 14:44:02,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=56, Invalid=221, Unknown=3, NotChecked=62, Total=342 [2019-11-21 14:44:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-21 14:44:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-11-21 14:44:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-21 14:44:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-21 14:44:02,167 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 22 [2019-11-21 14:44:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:44:02,167 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-21 14:44:02,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 14:44:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-21 14:44:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 14:44:02,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:44:02,169 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-21 14:44:02,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:44:02,372 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-21 14:44:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:44:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 14:44:02,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:44:02,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [378566072] [2019-11-21 14:44:02,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:44:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:44:02,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 14:44:02,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:44:02,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:44:02,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 14:44:02,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 14:44:02,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 14:44:02,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 14:44:02,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,816 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 14:44:02,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 14:44:02,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 14:44:02,887 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 14:44:02,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,899 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-21 14:44:02,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:02,945 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-21 14:44:02,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:02,979 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 14:44:02,979 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-21 14:44:02,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 14:44:03,020 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-21 14:44:03,020 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:44:03,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:03,495 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-21 14:44:03,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:03,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:03,520 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-21 14:44:03,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:03,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:03,532 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-21 14:44:03,533 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 14:44:03,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:44:03,587 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-21 14:44:03,587 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 14:44:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:44:03,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 14:44:03,744 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 14:44:05,144 WARN L192 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 14:44:05,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:44:05,154 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:44:05,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:44:05,161 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 14:44:05,217 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 14:44:05,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:05,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:05,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:44:05,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-21 14:44:05,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 14:44:05,425 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 14:44:05,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:44:05,629 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-21 14:44:05,634 INFO L168 Benchmark]: Toolchain (without parser) took 90779.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -322.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:44:05,635 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:44:05,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:44:05,635 INFO L168 Benchmark]: Boogie Preprocessor took 84.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-21 14:44:05,636 INFO L168 Benchmark]: RCFGBuilder took 957.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:44:05,637 INFO L168 Benchmark]: TraceAbstraction took 89134.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -269.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:44:05,639 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.46 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 599.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 957.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89134.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -269.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...