./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0214_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0214_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer --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 f24155d57089ee56b2ffe7387617084a63577a9c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 03:27:13,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:27:13,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:27:13,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:27:13,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:27:13,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:27:13,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:27:13,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:27:13,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:27:13,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:27:13,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:27:13,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:27:13,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:27:13,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:27:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:27:13,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:27:13,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:27:13,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:27:13,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:27:13,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:27:13,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:27:13,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:27:13,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:27:13,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:27:13,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:27:13,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:27:13,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:27:13,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:27:13,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:27:13,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:27:13,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:27:13,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:27:13,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:27:13,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:27:13,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:27:13,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:27:13,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:27:13,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:27:13,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:27:13,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:27:13,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:27:13,127 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 03:27:13,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:27:13,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:27:13,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:27:13,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:27:13,161 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:27:13,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:27:13,162 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:27:13,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:27:13,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:27:13,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:27:13,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:27:13,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 03:27:13,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 03:27:13,163 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 03:27:13,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:27:13,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:27:13,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:27:13,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:27:13,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:27:13,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:27:13,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:27:13,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:27:13,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:27:13,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:27:13,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:27:13,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:27:13,167 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:27:13,167 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:27:13,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:27:13,168 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer 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 -> f24155d57089ee56b2ffe7387617084a63577a9c [2019-11-20 03:27:13,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:27:13,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:27:13,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:27:13,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:27:13,390 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:27:13,390 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2019-11-20 03:27:13,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/data/178a3ace5/afa31eee3a664b4a92884e65b8777e4e/FLAGb761fe48d [2019-11-20 03:27:14,038 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:27:14,038 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2019-11-20 03:27:14,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/data/178a3ace5/afa31eee3a664b4a92884e65b8777e4e/FLAGb761fe48d [2019-11-20 03:27:14,341 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/data/178a3ace5/afa31eee3a664b4a92884e65b8777e4e [2019-11-20 03:27:14,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:27:14,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 03:27:14,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:27:14,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:27:14,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:27:14,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:27:14" (1/1) ... [2019-11-20 03:27:14,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c31d22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:14, skipping insertion in model container [2019-11-20 03:27:14,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:27:14" (1/1) ... [2019-11-20 03:27:14,375 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:27:14,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:27:15,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:27:15,060 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:27:15,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:27:15,237 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:27:15,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15 WrapperNode [2019-11-20 03:27:15,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:27:15,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:27:15,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:27:15,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:27:15,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... [2019-11-20 03:27:15,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:27:15,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:27:15,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:27:15,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:27:15,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:27:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 03:27:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:27:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 03:27:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 03:27:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 03:27:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 03:27:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 03:27:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_empty [2019-11-20 03:27:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure abort [2019-11-20 03:27:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure create_item [2019-11-20 03:27:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure append_one [2019-11-20 03:27:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_one [2019-11-20 03:27:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2019-11-20 03:27:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 03:27:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-20 03:27:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 03:27:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 03:27:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 03:27:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 03:27:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 03:27:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 03:27:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 03:27:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 03:27:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 03:27:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 03:27:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 03:27:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 03:27:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 03:27:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 03:27:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 03:27:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 03:27:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 03:27:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 03:27:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 03:27:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 03:27:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 03:27:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 03:27:15,429 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 03:27:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 03:27:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 03:27:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 03:27:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 03:27:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 03:27:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 03:27:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 03:27:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 03:27:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 03:27:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 03:27:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 03:27:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 03:27:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 03:27:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 03:27:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 03:27:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 03:27:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 03:27:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 03:27:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 03:27:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 03:27:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 03:27:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 03:27:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 03:27:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 03:27:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 03:27:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 03:27:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 03:27:15,441 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 03:27:15,441 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 03:27:15,441 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 03:27:15,441 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 03:27:15,441 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 03:27:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 03:27:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 03:27:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 03:27:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-20 03:27:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-20 03:27:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-20 03:27:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-20 03:27:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-20 03:27:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-20 03:27:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-20 03:27:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-20 03:27:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-20 03:27:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-20 03:27:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-20 03:27:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-20 03:27:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-20 03:27:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-20 03:27:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-20 03:27:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-20 03:27:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-20 03:27:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-20 03:27:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-20 03:27:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-20 03:27:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-20 03:27:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-20 03:27:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-20 03:27:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure ffsl [2019-11-20 03:27:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure ffsll [2019-11-20 03:27:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-20 03:27:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-20 03:27:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp_l [2019-11-20 03:27:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp_l [2019-11-20 03:27:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure explicit_bzero [2019-11-20 03:27:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-20 03:27:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_empty [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure create_item [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:27:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure append_one [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure remove_one [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2019-11-20 03:27:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 03:27:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 03:27:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:27:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 03:27:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:27:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 03:27:16,414 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:27:16,595 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint abortFINAL: assume true; [2019-11-20 03:27:16,761 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:27:16,762 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 03:27:16,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:27:16 BoogieIcfgContainer [2019-11-20 03:27:16,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:27:16,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:27:16,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:27:16,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:27:16,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:27:14" (1/3) ... [2019-11-20 03:27:16,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc28aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:27:16, skipping insertion in model container [2019-11-20 03:27:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:27:15" (2/3) ... [2019-11-20 03:27:16,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc28aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:27:16, skipping insertion in model container [2019-11-20 03:27:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:27:16" (3/3) ... [2019-11-20 03:27:16,774 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2019-11-20 03:27:16,785 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:27:16,793 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-20 03:27:16,806 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-20 03:27:16,830 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:27:16,831 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 03:27:16,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:27:16,831 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:27:16,831 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:27:16,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:27:16,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:27:16,832 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:27:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-20 03:27:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:27:16,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:16,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:16,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1238587595, now seen corresponding path program 1 times [2019-11-20 03:27:16,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:16,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [347626479] [2019-11-20 03:27:16,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:17,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:27:17,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:17,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:17,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:27:17,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:17,432 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 03:27:17,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:17,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:15 [2019-11-20 03:27:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:17,461 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:17,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [347626479] [2019-11-20 03:27:17,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:17,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 03:27:17,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491591754] [2019-11-20 03:27:17,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:27:17,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:27:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:27:17,526 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 4 states. [2019-11-20 03:27:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:18,558 INFO L93 Difference]: Finished difference Result 333 states and 370 transitions. [2019-11-20 03:27:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:27:18,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 03:27:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:18,576 INFO L225 Difference]: With dead ends: 333 [2019-11-20 03:27:18,577 INFO L226 Difference]: Without dead ends: 320 [2019-11-20 03:27:18,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:27:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-20 03:27:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 220. [2019-11-20 03:27:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 03:27:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 277 transitions. [2019-11-20 03:27:18,667 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 277 transitions. Word has length 10 [2019-11-20 03:27:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:18,668 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 277 transitions. [2019-11-20 03:27:18,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:27:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 277 transitions. [2019-11-20 03:27:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:27:18,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:18,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:18,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:18,874 INFO L410 AbstractCegarLoop]: === Iteration 2 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1238587594, now seen corresponding path program 1 times [2019-11-20 03:27:18,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:18,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [85216082] [2019-11-20 03:27:18,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:19,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:27:19,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:19,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:19,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:19,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:19,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:19,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:27:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:19,223 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:19,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85216082] [2019-11-20 03:27:19,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:19,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 03:27:19,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417982160] [2019-11-20 03:27:19,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:27:19,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:19,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:27:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:27:19,406 INFO L87 Difference]: Start difference. First operand 220 states and 277 transitions. Second operand 6 states. [2019-11-20 03:27:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:21,280 INFO L93 Difference]: Finished difference Result 600 states and 746 transitions. [2019-11-20 03:27:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:27:21,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 03:27:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:21,289 INFO L225 Difference]: With dead ends: 600 [2019-11-20 03:27:21,289 INFO L226 Difference]: Without dead ends: 600 [2019-11-20 03:27:21,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:27:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-20 03:27:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 454. [2019-11-20 03:27:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-20 03:27:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 672 transitions. [2019-11-20 03:27:21,343 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 672 transitions. Word has length 10 [2019-11-20 03:27:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:21,343 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 672 transitions. [2019-11-20 03:27:21,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:27:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 672 transitions. [2019-11-20 03:27:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:27:21,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:21,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:21,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:21,548 INFO L410 AbstractCegarLoop]: === Iteration 3 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -698831624, now seen corresponding path program 1 times [2019-11-20 03:27:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:21,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [131928362] [2019-11-20 03:27:21,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:21,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:27:21,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:21,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:21,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-20 03:27:21,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [131928362] [2019-11-20 03:27:21,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:21,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:27:21,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324864293] [2019-11-20 03:27:21,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:27:21,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:27:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:27:21,816 INFO L87 Difference]: Start difference. First operand 454 states and 672 transitions. Second operand 4 states. [2019-11-20 03:27:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:21,877 INFO L93 Difference]: Finished difference Result 518 states and 767 transitions. [2019-11-20 03:27:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:27:21,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 03:27:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:21,884 INFO L225 Difference]: With dead ends: 518 [2019-11-20 03:27:21,884 INFO L226 Difference]: Without dead ends: 518 [2019-11-20 03:27:21,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:27:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-20 03:27:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 500. [2019-11-20 03:27:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-20 03:27:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 746 transitions. [2019-11-20 03:27:21,918 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 746 transitions. Word has length 13 [2019-11-20 03:27:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:21,919 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 746 transitions. [2019-11-20 03:27:21,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:27:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 746 transitions. [2019-11-20 03:27:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:27:21,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:21,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:22,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:22,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1382714092, now seen corresponding path program 1 times [2019-11-20 03:27:22,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:22,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1732461213] [2019-11-20 03:27:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:22,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:27:22,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:22,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:22,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:27:22,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:22,455 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 03:27:22,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:22,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:15 [2019-11-20 03:27:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:22,522 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:22,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1732461213] [2019-11-20 03:27:22,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:22,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 03:27:22,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294390572] [2019-11-20 03:27:22,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:27:22,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:27:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:27:22,595 INFO L87 Difference]: Start difference. First operand 500 states and 746 transitions. Second operand 8 states. [2019-11-20 03:27:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:23,829 INFO L93 Difference]: Finished difference Result 639 states and 906 transitions. [2019-11-20 03:27:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:27:23,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-20 03:27:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:23,835 INFO L225 Difference]: With dead ends: 639 [2019-11-20 03:27:23,835 INFO L226 Difference]: Without dead ends: 639 [2019-11-20 03:27:23,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:27:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-11-20 03:27:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 496. [2019-11-20 03:27:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-20 03:27:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 728 transitions. [2019-11-20 03:27:23,867 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 728 transitions. Word has length 15 [2019-11-20 03:27:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:23,870 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 728 transitions. [2019-11-20 03:27:23,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:27:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 728 transitions. [2019-11-20 03:27:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:27:23,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:23,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:24,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:24,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1382714091, now seen corresponding path program 1 times [2019-11-20 03:27:24,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:24,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1693941745] [2019-11-20 03:27:24,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:24,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 03:27:24,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:24,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:24,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:24,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:24,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:24,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:27:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:24,412 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:25,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1693941745] [2019-11-20 03:27:25,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:25,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 03:27:25,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880818210] [2019-11-20 03:27:25,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:27:25,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:27:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:27:25,031 INFO L87 Difference]: Start difference. First operand 496 states and 728 transitions. Second operand 12 states. [2019-11-20 03:27:26,604 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-11-20 03:27:27,130 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 03:27:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:29,191 INFO L93 Difference]: Finished difference Result 611 states and 775 transitions. [2019-11-20 03:27:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:27:29,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-11-20 03:27:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:29,197 INFO L225 Difference]: With dead ends: 611 [2019-11-20 03:27:29,197 INFO L226 Difference]: Without dead ends: 611 [2019-11-20 03:27:29,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:27:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-20 03:27:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 502. [2019-11-20 03:27:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-20 03:27:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 735 transitions. [2019-11-20 03:27:29,218 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 735 transitions. Word has length 15 [2019-11-20 03:27:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:29,219 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 735 transitions. [2019-11-20 03:27:29,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:27:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 735 transitions. [2019-11-20 03:27:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:27:29,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:29,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:29,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:29,428 INFO L410 AbstractCegarLoop]: === Iteration 6 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -188945187, now seen corresponding path program 1 times [2019-11-20 03:27:29,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:29,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [7575526] [2019-11-20 03:27:29,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:29,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:27:29,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:29,658 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:29,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7575526] [2019-11-20 03:27:29,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:29,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:27:29,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976879682] [2019-11-20 03:27:29,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:27:29,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:27:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:27:29,664 INFO L87 Difference]: Start difference. First operand 502 states and 735 transitions. Second operand 3 states. [2019-11-20 03:27:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:29,970 INFO L93 Difference]: Finished difference Result 605 states and 891 transitions. [2019-11-20 03:27:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:27:29,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 03:27:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:29,974 INFO L225 Difference]: With dead ends: 605 [2019-11-20 03:27:29,974 INFO L226 Difference]: Without dead ends: 598 [2019-11-20 03:27:29,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:27:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-20 03:27:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 518. [2019-11-20 03:27:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-20 03:27:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 754 transitions. [2019-11-20 03:27:30,007 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 754 transitions. Word has length 14 [2019-11-20 03:27:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:30,008 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 754 transitions. [2019-11-20 03:27:30,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:27:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 754 transitions. [2019-11-20 03:27:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:27:30,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:30,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:30,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:30,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -425535021, now seen corresponding path program 1 times [2019-11-20 03:27:30,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:30,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [290386639] [2019-11-20 03:27:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:30,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 03:27:30,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:30,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:30,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:30,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:30,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:30,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:27:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:30,473 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:30,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [290386639] [2019-11-20 03:27:30,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:30,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 03:27:30,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212789681] [2019-11-20 03:27:30,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:27:30,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:30,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:27:30,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:27:30,758 INFO L87 Difference]: Start difference. First operand 518 states and 754 transitions. Second operand 12 states. [2019-11-20 03:27:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:34,699 INFO L93 Difference]: Finished difference Result 617 states and 784 transitions. [2019-11-20 03:27:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:27:34,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 03:27:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:34,705 INFO L225 Difference]: With dead ends: 617 [2019-11-20 03:27:34,705 INFO L226 Difference]: Without dead ends: 617 [2019-11-20 03:27:34,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:27:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-20 03:27:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 517. [2019-11-20 03:27:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-20 03:27:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 740 transitions. [2019-11-20 03:27:34,730 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 740 transitions. Word has length 18 [2019-11-20 03:27:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 740 transitions. [2019-11-20 03:27:34,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:27:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 740 transitions. [2019-11-20 03:27:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:27:34,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:34,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:34,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:34,936 INFO L410 AbstractCegarLoop]: === Iteration 8 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash -425535022, now seen corresponding path program 1 times [2019-11-20 03:27:34,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:34,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1114779048] [2019-11-20 03:27:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:35,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:27:35,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:35,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:35,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:27:35,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:35,188 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 03:27:35,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:35,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:15 [2019-11-20 03:27:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:35,277 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:35,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1114779048] [2019-11-20 03:27:35,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:35,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 03:27:35,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712152086] [2019-11-20 03:27:35,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:27:35,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:35,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:27:35,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:27:35,371 INFO L87 Difference]: Start difference. First operand 517 states and 740 transitions. Second operand 12 states. [2019-11-20 03:27:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:36,727 INFO L93 Difference]: Finished difference Result 645 states and 869 transitions. [2019-11-20 03:27:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:27:36,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 03:27:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:36,737 INFO L225 Difference]: With dead ends: 645 [2019-11-20 03:27:36,737 INFO L226 Difference]: Without dead ends: 645 [2019-11-20 03:27:36,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:27:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-11-20 03:27:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 514. [2019-11-20 03:27:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-11-20 03:27:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 720 transitions. [2019-11-20 03:27:36,758 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 720 transitions. Word has length 18 [2019-11-20 03:27:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:36,758 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 720 transitions. [2019-11-20 03:27:36,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:27:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 720 transitions. [2019-11-20 03:27:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:27:36,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:36,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:36,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:36,966 INFO L410 AbstractCegarLoop]: === Iteration 9 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:36,967 INFO L82 PathProgramCache]: Analyzing trace with hash -359843184, now seen corresponding path program 1 times [2019-11-20 03:27:36,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:36,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1022359406] [2019-11-20 03:27:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:37,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:27:37,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:37,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:37,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:37,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:37,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:37,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 03:27:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:37,191 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:37,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1022359406] [2019-11-20 03:27:37,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:37,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:27:37,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551822742] [2019-11-20 03:27:37,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:27:37,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:27:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:27:37,203 INFO L87 Difference]: Start difference. First operand 514 states and 720 transitions. Second operand 3 states. [2019-11-20 03:27:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:37,393 INFO L93 Difference]: Finished difference Result 511 states and 708 transitions. [2019-11-20 03:27:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:27:37,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 03:27:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:37,397 INFO L225 Difference]: With dead ends: 511 [2019-11-20 03:27:37,397 INFO L226 Difference]: Without dead ends: 511 [2019-11-20 03:27:37,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:27:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-20 03:27:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-11-20 03:27:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-11-20 03:27:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 708 transitions. [2019-11-20 03:27:37,413 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 708 transitions. Word has length 22 [2019-11-20 03:27:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:37,415 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 708 transitions. [2019-11-20 03:27:37,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:27:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 708 transitions. [2019-11-20 03:27:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:27:37,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:37,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:37,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:37,622 INFO L410 AbstractCegarLoop]: === Iteration 10 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -359843183, now seen corresponding path program 1 times [2019-11-20 03:27:37,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:37,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1032539763] [2019-11-20 03:27:37,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:37,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:27:37,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:37,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:37,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:37,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:37,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:37,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:27:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:37,954 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:38,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032539763] [2019-11-20 03:27:38,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:38,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 03:27:38,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175876128] [2019-11-20 03:27:38,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:27:38,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:27:38,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:27:38,069 INFO L87 Difference]: Start difference. First operand 511 states and 708 transitions. Second operand 6 states. [2019-11-20 03:27:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:38,725 INFO L93 Difference]: Finished difference Result 561 states and 768 transitions. [2019-11-20 03:27:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:27:38,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-20 03:27:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:38,729 INFO L225 Difference]: With dead ends: 561 [2019-11-20 03:27:38,729 INFO L226 Difference]: Without dead ends: 561 [2019-11-20 03:27:38,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:27:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-11-20 03:27:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2019-11-20 03:27:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-20 03:27:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 712 transitions. [2019-11-20 03:27:38,743 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 712 transitions. Word has length 22 [2019-11-20 03:27:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:38,744 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 712 transitions. [2019-11-20 03:27:38,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:27:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 712 transitions. [2019-11-20 03:27:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:27:38,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:38,745 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, 1] [2019-11-20 03:27:38,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:38,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1729763414, now seen corresponding path program 1 times [2019-11-20 03:27:38,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:38,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1764505275] [2019-11-20 03:27:38,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:39,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:27:39,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:39,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:27:39,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:39,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:39,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:39,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:27:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:39,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:39,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1764505275] [2019-11-20 03:27:39,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:39,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 03:27:39,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069550713] [2019-11-20 03:27:39,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:27:39,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:27:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:27:39,520 INFO L87 Difference]: Start difference. First operand 518 states and 712 transitions. Second operand 8 states. [2019-11-20 03:27:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:40,862 INFO L93 Difference]: Finished difference Result 564 states and 768 transitions. [2019-11-20 03:27:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:27:40,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-20 03:27:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:40,865 INFO L225 Difference]: With dead ends: 564 [2019-11-20 03:27:40,865 INFO L226 Difference]: Without dead ends: 564 [2019-11-20 03:27:40,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:27:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-20 03:27:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 522. [2019-11-20 03:27:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-11-20 03:27:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 716 transitions. [2019-11-20 03:27:40,877 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 716 transitions. Word has length 23 [2019-11-20 03:27:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:40,878 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 716 transitions. [2019-11-20 03:27:40,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:27:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 716 transitions. [2019-11-20 03:27:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:27:40,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:40,879 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, 1] [2019-11-20 03:27:41,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:41,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1729821040, now seen corresponding path program 1 times [2019-11-20 03:27:41,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:41,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [508348419] [2019-11-20 03:27:41,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:41,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:27:41,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:41,326 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:41,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [508348419] [2019-11-20 03:27:41,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:41,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-20 03:27:41,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128886412] [2019-11-20 03:27:41,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:27:41,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:41,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:27:41,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:27:41,374 INFO L87 Difference]: Start difference. First operand 522 states and 716 transitions. Second operand 9 states. [2019-11-20 03:27:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:41,513 INFO L93 Difference]: Finished difference Result 504 states and 684 transitions. [2019-11-20 03:27:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:27:41,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-20 03:27:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:41,516 INFO L225 Difference]: With dead ends: 504 [2019-11-20 03:27:41,516 INFO L226 Difference]: Without dead ends: 504 [2019-11-20 03:27:41,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:27:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-20 03:27:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-11-20 03:27:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-20 03:27:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 684 transitions. [2019-11-20 03:27:41,528 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 684 transitions. Word has length 23 [2019-11-20 03:27:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:41,529 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 684 transitions. [2019-11-20 03:27:41,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:27:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 684 transitions. [2019-11-20 03:27:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:27:41,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:41,530 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, 1, 1] [2019-11-20 03:27:41,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:41,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash 77828054, now seen corresponding path program 1 times [2019-11-20 03:27:41,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:41,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044630905] [2019-11-20 03:27:41,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:41,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 03:27:41,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:42,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:42,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:42,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:42,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:42,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 03:27:42,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:42,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:42,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:42,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:42,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:42,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-11-20 03:27:42,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:42,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:42,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:42,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:15 [2019-11-20 03:27:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:42,313 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:43,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:43,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:27:43,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:27:43,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:27:43,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,153 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:43,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:27:43,168 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,172 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:43,173 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:43,174 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:27:43,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,175 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:249, output treesize:1 [2019-11-20 03:27:43,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:43,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:27:43,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:27:43,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,194 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:43,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,197 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:43,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:27:43,220 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:43,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:43,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:27:43,233 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:43,234 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:27:43,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:43,235 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:249, output treesize:1 [2019-11-20 03:27:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:43,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044630905] [2019-11-20 03:27:43,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:43,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 03:27:43,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759757254] [2019-11-20 03:27:43,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 03:27:43,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 03:27:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:27:43,245 INFO L87 Difference]: Start difference. First operand 504 states and 684 transitions. Second operand 20 states. [2019-11-20 03:27:46,172 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 03:27:46,450 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 03:27:46,665 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 03:27:46,960 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 03:27:47,316 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 03:27:47,650 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-20 03:27:48,050 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-20 03:27:48,385 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 03:27:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:48,875 INFO L93 Difference]: Finished difference Result 721 states and 938 transitions. [2019-11-20 03:27:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 03:27:48,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-11-20 03:27:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:48,879 INFO L225 Difference]: With dead ends: 721 [2019-11-20 03:27:48,879 INFO L226 Difference]: Without dead ends: 721 [2019-11-20 03:27:48,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 03:27:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-11-20 03:27:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 637. [2019-11-20 03:27:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-11-20 03:27:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 856 transitions. [2019-11-20 03:27:48,900 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 856 transitions. Word has length 24 [2019-11-20 03:27:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:48,900 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 856 transitions. [2019-11-20 03:27:48,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 03:27:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 856 transitions. [2019-11-20 03:27:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 03:27:48,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:48,902 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, 1, 1, 1, 1, 1] [2019-11-20 03:27:49,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:49,105 INFO L410 AbstractCegarLoop]: === Iteration 14 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1586959399, now seen corresponding path program 1 times [2019-11-20 03:27:49,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:49,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341108543] [2019-11-20 03:27:49,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:49,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 03:27:49,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:49,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:49,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:49,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-20 03:27:49,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:49,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:49,552 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:27:49,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:49,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 10 [2019-11-20 03:27:49,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:49,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:49,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:49,564 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-11-20 03:27:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:49,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:50,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2019-11-20 03:27:50,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,086 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:50,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:50,087 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:27:50,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:1 [2019-11-20 03:27:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:50,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:27:50,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2019-11-20 03:27:50,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,101 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:27:50,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:50,103 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:27:50,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:50,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:1 [2019-11-20 03:27:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:50,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341108543] [2019-11-20 03:27:50,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:50,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 15 [2019-11-20 03:27:50,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357178510] [2019-11-20 03:27:50,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 03:27:50,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 03:27:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-20 03:27:50,106 INFO L87 Difference]: Start difference. First operand 637 states and 856 transitions. Second operand 15 states. [2019-11-20 03:27:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:27:51,596 INFO L93 Difference]: Finished difference Result 745 states and 976 transitions. [2019-11-20 03:27:51,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:27:51,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-20 03:27:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:27:51,601 INFO L225 Difference]: With dead ends: 745 [2019-11-20 03:27:51,601 INFO L226 Difference]: Without dead ends: 745 [2019-11-20 03:27:51,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:27:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-20 03:27:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 702. [2019-11-20 03:27:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-20 03:27:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 939 transitions. [2019-11-20 03:27:51,624 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 939 transitions. Word has length 27 [2019-11-20 03:27:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:27:51,624 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 939 transitions. [2019-11-20 03:27:51,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 03:27:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 939 transitions. [2019-11-20 03:27:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:27:51,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:27:51,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:27:51,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:51,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:27:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:27:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1304584448, now seen corresponding path program 1 times [2019-11-20 03:27:51,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:27:51,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1948719638] [2019-11-20 03:27:51,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:27:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:27:52,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 03:27:52,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:27:52,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:52,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:27:52,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:52,237 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-20 03:27:52,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:27:52,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:15 [2019-11-20 03:27:52,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:52,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:52,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 58 [2019-11-20 03:27:52,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:52,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:27:52,394 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 15 treesize of output 31 [2019-11-20 03:27:52,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:27:52,470 INFO L567 ElimStorePlain]: treesize reduction 42, result has 45.5 percent of original size [2019-11-20 03:27:52,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:52,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 03:27:52,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2019-11-20 03:27:52,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:27:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:52,510 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:27:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:27:52,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1948719638] [2019-11-20 03:27:52,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:27:52,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 3] imperfect sequences [] total 8 [2019-11-20 03:27:52,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58441632] [2019-11-20 03:27:52,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:27:52,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:27:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:27:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:27:52,684 INFO L87 Difference]: Start difference. First operand 702 states and 939 transitions. Second operand 9 states. [2019-11-20 03:27:54,750 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-20 03:27:56,801 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 03:27:58,835 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:28:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:41,308 INFO L93 Difference]: Finished difference Result 925 states and 1234 transitions. [2019-11-20 03:28:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:28:41,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-20 03:28:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:41,314 INFO L225 Difference]: With dead ends: 925 [2019-11-20 03:28:41,314 INFO L226 Difference]: Without dead ends: 925 [2019-11-20 03:28:41,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:28:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-11-20 03:28:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 701. [2019-11-20 03:28:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-11-20 03:28:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 935 transitions. [2019-11-20 03:28:41,332 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 935 transitions. Word has length 31 [2019-11-20 03:28:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:41,332 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 935 transitions. [2019-11-20 03:28:41,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:28:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 935 transitions. [2019-11-20 03:28:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:28:41,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:41,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:41,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:28:41,538 INFO L410 AbstractCegarLoop]: === Iteration 16 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:28:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1304584447, now seen corresponding path program 1 times [2019-11-20 03:28:41,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:28:41,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1382843078] [2019-11-20 03:28:41,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:28:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:41,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:28:41,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:28:41,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:28:41,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:41,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:28:41,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:28:41,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:28:41,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:41,847 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-20 03:28:41,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:28:41,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:23 [2019-11-20 03:28:42,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,060 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_46|], 3=[|v_old(#valid)_AFTER_CALL_52|]} [2019-11-20 03:28:42,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:28:42,068 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 33 treesize of output 35 [2019-11-20 03:28:42,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:42,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:28:42,076 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 35 treesize of output 37 [2019-11-20 03:28:42,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:42,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:28:42,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:28:42,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:28:42,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2019-11-20 03:28:42,130 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:42,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:28:42,135 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 34 treesize of output 30 [2019-11-20 03:28:42,135 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:28:42,161 INFO L567 ElimStorePlain]: treesize reduction 27, result has 41.3 percent of original size [2019-11-20 03:28:42,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:28:42,161 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:19 [2019-11-20 03:28:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:42,194 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:28:42,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:28:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:28:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:42,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:54,621 WARN L191 SmtUtils]: Spent 7.66 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-11-20 03:28:54,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:01,064 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-20 03:29:01,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:29:01,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:29:01,131 INFO L567 ElimStorePlain]: treesize reduction 35, result has 2.8 percent of original size [2019-11-20 03:29:01,131 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_177| vanished before elimination [2019-11-20 03:29:01,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:29:01,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:1 [2019-11-20 03:29:01,138 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:29:01,138 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:29:01,140 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:29:01,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:29:01,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:29:01,141 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 03:29:01,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:29:01,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:1 [2019-11-20 03:29:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:01,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1382843078] [2019-11-20 03:29:01,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:01,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 19 [2019-11-20 03:29:01,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451015593] [2019-11-20 03:29:01,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 03:29:01,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:29:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 03:29:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=322, Unknown=1, NotChecked=0, Total=380 [2019-11-20 03:29:01,151 INFO L87 Difference]: Start difference. First operand 701 states and 935 transitions. Second operand 20 states. [2019-11-20 03:29:25,123 WARN L191 SmtUtils]: Spent 10.36 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 03:29:58,756 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-20 03:30:06,663 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 03:30:20,227 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-20 03:30:23,157 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 03:30:23,736 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 03:30:24,792 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-20 03:30:39,585 WARN L191 SmtUtils]: Spent 8.30 s on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 03:30:46,351 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 03:30:59,446 WARN L191 SmtUtils]: Spent 8.66 s on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-20 03:31:00,324 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-20 03:31:08,812 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-20 03:31:29,710 WARN L191 SmtUtils]: Spent 6.16 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 03:31:49,037 WARN L191 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-20 03:32:06,164 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 03:32:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:19,534 INFO L93 Difference]: Finished difference Result 1548 states and 2087 transitions. [2019-11-20 03:32:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 03:32:19,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-11-20 03:32:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:19,542 INFO L225 Difference]: With dead ends: 1548 [2019-11-20 03:32:19,542 INFO L226 Difference]: Without dead ends: 1548 [2019-11-20 03:32:19,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 106.8s TimeCoverageRelationStatistics Valid=285, Invalid=1680, Unknown=15, NotChecked=0, Total=1980 [2019-11-20 03:32:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2019-11-20 03:32:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 834. [2019-11-20 03:32:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-20 03:32:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1130 transitions. [2019-11-20 03:32:19,567 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1130 transitions. Word has length 31 [2019-11-20 03:32:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1130 transitions. [2019-11-20 03:32:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 03:32:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1130 transitions. [2019-11-20 03:32:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:32:19,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:19,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:19,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:19,772 INFO L410 AbstractCegarLoop]: === Iteration 17 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 41904902, now seen corresponding path program 1 times [2019-11-20 03:32:19,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:19,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [785356559] [2019-11-20 03:32:19,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:19,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 03:32:20,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:20,138 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 13 [2019-11-20 03:32:20,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:3 [2019-11-20 03:32:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:20,159 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:20,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:20,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 16 [2019-11-20 03:32:20,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:1 [2019-11-20 03:32:20,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:20,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:20,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 16 [2019-11-20 03:32:20,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:20,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:20,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:1 [2019-11-20 03:32:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:20,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [785356559] [2019-11-20 03:32:20,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:20,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 15 [2019-11-20 03:32:20,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705581760] [2019-11-20 03:32:20,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 03:32:20,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 03:32:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:32:20,406 INFO L87 Difference]: Start difference. First operand 834 states and 1130 transitions. Second operand 16 states. [2019-11-20 03:32:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:21,817 INFO L93 Difference]: Finished difference Result 874 states and 1159 transitions. [2019-11-20 03:32:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:32:21,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-20 03:32:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:21,821 INFO L225 Difference]: With dead ends: 874 [2019-11-20 03:32:21,821 INFO L226 Difference]: Without dead ends: 874 [2019-11-20 03:32:21,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-11-20 03:32:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-20 03:32:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 830. [2019-11-20 03:32:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-20 03:32:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1119 transitions. [2019-11-20 03:32:21,839 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1119 transitions. Word has length 31 [2019-11-20 03:32:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:21,840 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1119 transitions. [2019-11-20 03:32:21,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 03:32:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1119 transitions. [2019-11-20 03:32:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 03:32:21,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:21,841 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:22,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:22,045 INFO L410 AbstractCegarLoop]: === Iteration 18 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -529235518, now seen corresponding path program 1 times [2019-11-20 03:32:22,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:22,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1768545140] [2019-11-20 03:32:22,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:22,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 03:32:22,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:22,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:22,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:22,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:22,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:22,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 03:32:22,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:22,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:22,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:22,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:22,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:22,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-11-20 03:32:22,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:22,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:22,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:22,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:15 [2019-11-20 03:32:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:22,640 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:32:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,682 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:32:23,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,697 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:23,697 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,700 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:23,700 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,705 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:32:23,710 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:23,711 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:23,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,711 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:249, output treesize:1 [2019-11-20 03:32:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:32:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:23,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:32:23,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,747 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:23,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,750 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:23,750 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:23,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:23,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2019-11-20 03:32:23,763 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:23,765 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:23,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:23,765 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:249, output treesize:1 [2019-11-20 03:32:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:23,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768545140] [2019-11-20 03:32:23,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:32:23,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-20 03:32:23,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199146545] [2019-11-20 03:32:23,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 03:32:23,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 03:32:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-20 03:32:23,781 INFO L87 Difference]: Start difference. First operand 830 states and 1119 transitions. Second operand 24 states. [2019-11-20 03:32:24,382 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-20 03:32:26,092 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 03:32:26,459 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-20 03:32:26,634 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 03:32:26,955 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-20 03:32:27,394 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-20 03:32:27,796 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-20 03:32:28,269 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-20 03:32:28,654 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-20 03:32:30,181 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 03:32:30,497 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-11-20 03:32:30,672 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 03:32:30,988 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-11-20 03:32:31,392 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-11-20 03:32:31,769 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-11-20 03:32:32,327 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-20 03:32:32,705 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-11-20 03:32:35,318 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-20 03:32:35,822 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-20 03:32:36,174 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-20 03:32:36,689 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-20 03:32:37,321 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-11-20 03:32:37,921 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-11-20 03:32:38,664 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-11-20 03:32:39,292 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-11-20 03:32:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:39,862 INFO L93 Difference]: Finished difference Result 1113 states and 1442 transitions. [2019-11-20 03:32:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-20 03:32:39,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-11-20 03:32:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:39,866 INFO L225 Difference]: With dead ends: 1113 [2019-11-20 03:32:39,866 INFO L226 Difference]: Without dead ends: 1113 [2019-11-20 03:32:39,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=538, Invalid=2768, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 03:32:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-20 03:32:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 736. [2019-11-20 03:32:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-11-20 03:32:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 993 transitions. [2019-11-20 03:32:39,884 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 993 transitions. Word has length 32 [2019-11-20 03:32:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:39,884 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 993 transitions. [2019-11-20 03:32:39,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 03:32:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 993 transitions. [2019-11-20 03:32:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 03:32:39,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:39,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:40,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:40,089 INFO L410 AbstractCegarLoop]: === Iteration 19 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1299052058, now seen corresponding path program 1 times [2019-11-20 03:32:40,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:40,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1782121777] [2019-11-20 03:32:40,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:40,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 03:32:40,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:40,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 13 [2019-11-20 03:32:40,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-11-20 03:32:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:40,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:40,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:40,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 16 [2019-11-20 03:32:40,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:1 [2019-11-20 03:32:40,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:40,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:40,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 16 [2019-11-20 03:32:40,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:40,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:40,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:1 [2019-11-20 03:32:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:40,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1782121777] [2019-11-20 03:32:40,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:40,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-20 03:32:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984203524] [2019-11-20 03:32:40,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 03:32:40,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:32:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:32:40,879 INFO L87 Difference]: Start difference. First operand 736 states and 993 transitions. Second operand 17 states. [2019-11-20 03:32:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:42,576 INFO L93 Difference]: Finished difference Result 834 states and 1100 transitions. [2019-11-20 03:32:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:32:42,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-11-20 03:32:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:42,580 INFO L225 Difference]: With dead ends: 834 [2019-11-20 03:32:42,580 INFO L226 Difference]: Without dead ends: 834 [2019-11-20 03:32:42,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-20 03:32:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-11-20 03:32:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 783. [2019-11-20 03:32:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-20 03:32:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1049 transitions. [2019-11-20 03:32:42,596 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1049 transitions. Word has length 32 [2019-11-20 03:32:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:42,596 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1049 transitions. [2019-11-20 03:32:42,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 03:32:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1049 transitions. [2019-11-20 03:32:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:32:42,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:42,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:42,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:42,802 INFO L410 AbstractCegarLoop]: === Iteration 20 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1030374207, now seen corresponding path program 1 times [2019-11-20 03:32:42,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:42,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1812374308] [2019-11-20 03:32:42,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:42,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:32:42,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:43,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:43,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1812374308] [2019-11-20 03:32:43,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:43,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 03:32:43,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910605861] [2019-11-20 03:32:43,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:32:43,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:32:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:32:43,062 INFO L87 Difference]: Start difference. First operand 783 states and 1049 transitions. Second operand 10 states. [2019-11-20 03:32:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:43,135 INFO L93 Difference]: Finished difference Result 783 states and 1037 transitions. [2019-11-20 03:32:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:32:43,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-20 03:32:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:43,149 INFO L225 Difference]: With dead ends: 783 [2019-11-20 03:32:43,149 INFO L226 Difference]: Without dead ends: 783 [2019-11-20 03:32:43,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:32:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-11-20 03:32:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2019-11-20 03:32:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-20 03:32:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1037 transitions. [2019-11-20 03:32:43,166 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1037 transitions. Word has length 34 [2019-11-20 03:32:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:43,166 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1037 transitions. [2019-11-20 03:32:43,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:32:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1037 transitions. [2019-11-20 03:32:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:32:43,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:43,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:43,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:43,373 INFO L410 AbstractCegarLoop]: === Iteration 21 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1030372285, now seen corresponding path program 1 times [2019-11-20 03:32:43,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:43,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1173179247] [2019-11-20 03:32:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:43,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:32:43,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:43,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:43,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:43,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-20 03:32:43,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:43,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:43,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:43,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:43,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:43,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 19 [2019-11-20 03:32:43,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:43,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:43,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:43,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:13 [2019-11-20 03:32:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:43,980 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:44,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-11-20 03:32:44,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,315 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:44,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:44,316 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:44,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:1 [2019-11-20 03:32:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:44,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:44,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:44,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-11-20 03:32:44,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,332 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:44,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:44,333 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:44,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:44,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:1 [2019-11-20 03:32:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:44,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173179247] [2019-11-20 03:32:44,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:44,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 15 [2019-11-20 03:32:44,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699594394] [2019-11-20 03:32:44,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 03:32:44,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 03:32:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-20 03:32:44,337 INFO L87 Difference]: Start difference. First operand 783 states and 1037 transitions. Second operand 15 states. [2019-11-20 03:32:45,380 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-20 03:32:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:45,787 INFO L93 Difference]: Finished difference Result 785 states and 1019 transitions. [2019-11-20 03:32:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:32:45,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-20 03:32:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:45,791 INFO L225 Difference]: With dead ends: 785 [2019-11-20 03:32:45,791 INFO L226 Difference]: Without dead ends: 785 [2019-11-20 03:32:45,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:32:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-20 03:32:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 768. [2019-11-20 03:32:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-20 03:32:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1006 transitions. [2019-11-20 03:32:45,805 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1006 transitions. Word has length 34 [2019-11-20 03:32:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:45,805 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1006 transitions. [2019-11-20 03:32:45,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 03:32:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1006 transitions. [2019-11-20 03:32:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:32:45,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:45,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:46,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:46,011 INFO L410 AbstractCegarLoop]: === Iteration 22 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1446452259, now seen corresponding path program 1 times [2019-11-20 03:32:46,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:46,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1316180012] [2019-11-20 03:32:46,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:46,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 03:32:46,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:46,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:46,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:46,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:46,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:46,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 1 [2019-11-20 03:32:46,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:46,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 03:32:46,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:46,709 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:32:46,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:46,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 43 [2019-11-20 03:32:46,717 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:46,731 INFO L567 ElimStorePlain]: treesize reduction 9, result has 69.0 percent of original size [2019-11-20 03:32:46,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:46,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 15 [2019-11-20 03:32:46,738 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:46,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:46,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:46,739 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:137, output treesize:5 [2019-11-20 03:32:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:46,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:47,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:47,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:47,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:47,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:47,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2019-11-20 03:32:47,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,271 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:47,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:47,272 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:47,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:1 [2019-11-20 03:32:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:47,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:47,278 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:32:47,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:47,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2019-11-20 03:32:47,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:47,285 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-20 03:32:47,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:47,286 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:1 [2019-11-20 03:32:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:47,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1316180012] [2019-11-20 03:32:47,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:47,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2019-11-20 03:32:47,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373166566] [2019-11-20 03:32:47,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 03:32:47,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:47,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:32:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:32:47,290 INFO L87 Difference]: Start difference. First operand 768 states and 1006 transitions. Second operand 21 states. [2019-11-20 03:32:48,699 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-20 03:32:48,938 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-11-20 03:32:49,272 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-11-20 03:32:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:50,229 INFO L93 Difference]: Finished difference Result 499 states and 657 transitions. [2019-11-20 03:32:50,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:32:50,231 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-20 03:32:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:50,234 INFO L225 Difference]: With dead ends: 499 [2019-11-20 03:32:50,234 INFO L226 Difference]: Without dead ends: 499 [2019-11-20 03:32:50,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 03:32:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-20 03:32:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 474. [2019-11-20 03:32:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-20 03:32:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 629 transitions. [2019-11-20 03:32:50,243 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 629 transitions. Word has length 34 [2019-11-20 03:32:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:50,243 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 629 transitions. [2019-11-20 03:32:50,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 03:32:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 629 transitions. [2019-11-20 03:32:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:32:50,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:50,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:50,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:50,449 INFO L410 AbstractCegarLoop]: === Iteration 23 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1585556990, now seen corresponding path program 1 times [2019-11-20 03:32:50,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:50,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1178622465] [2019-11-20 03:32:50,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:50,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 03:32:50,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:51,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:51,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:51,447 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 30 treesize of output 26 [2019-11-20 03:32:51,447 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:51,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-11-20 03:32:51,456 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:51,543 INFO L567 ElimStorePlain]: treesize reduction 9, result has 84.5 percent of original size [2019-11-20 03:32:51,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 03:32:51,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:49 [2019-11-20 03:32:51,679 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-11-20 03:32:51,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:51,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:51,857 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 33 treesize of output 35 [2019-11-20 03:32:51,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:51,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:51,858 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:51,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:51,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:51,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:51,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:60 [2019-11-20 03:32:51,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:52,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:53,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:53,888 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-20 03:32:54,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:55,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1178622465] [2019-11-20 03:32:55,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:55,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 15 [2019-11-20 03:32:55,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776736024] [2019-11-20 03:32:55,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 03:32:55,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 03:32:55,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:32:55,335 INFO L87 Difference]: Start difference. First operand 474 states and 629 transitions. Second operand 16 states. [2019-11-20 03:32:55,857 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-11-20 03:32:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:57,143 INFO L93 Difference]: Finished difference Result 495 states and 648 transitions. [2019-11-20 03:32:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:32:57,145 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-11-20 03:32:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:57,147 INFO L225 Difference]: With dead ends: 495 [2019-11-20 03:32:57,147 INFO L226 Difference]: Without dead ends: 495 [2019-11-20 03:32:57,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-11-20 03:32:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-20 03:32:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 461. [2019-11-20 03:32:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-11-20 03:32:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 607 transitions. [2019-11-20 03:32:57,153 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 607 transitions. Word has length 45 [2019-11-20 03:32:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:57,153 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 607 transitions. [2019-11-20 03:32:57,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 03:32:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 607 transitions. [2019-11-20 03:32:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:32:57,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:57,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:32:57,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:57,355 INFO L410 AbstractCegarLoop]: === Iteration 24 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:32:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 720326570, now seen corresponding path program 1 times [2019-11-20 03:32:57,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:32:57,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [663471234] [2019-11-20 03:32:57,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:32:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:32:57,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 03:32:57,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:32:57,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-20 03:32:57,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:57,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:13 [2019-11-20 03:32:57,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:32:57,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:57,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 03:32:57,797 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 15 treesize of output 11 [2019-11-20 03:32:57,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:57,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-20 03:32:57,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 03:32:57,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:57,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:57,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-20 03:32:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:57,947 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:32:58,189 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_248|], 1=[|v_#valid_247|]} [2019-11-20 03:32:58,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-20 03:32:58,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,199 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 59 treesize of output 42 [2019-11-20 03:32:58,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,204 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 18 treesize of output 16 [2019-11-20 03:32:58,207 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 34 treesize of output 28 [2019-11-20 03:32:58,207 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,209 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,211 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:32, output treesize:11 [2019-11-20 03:32:58,268 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 52 treesize of output 44 [2019-11-20 03:32:58,268 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:58,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:32:58,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:56 [2019-11-20 03:32:58,607 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-20 03:32:58,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:32:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:58,838 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 30 treesize of output 28 [2019-11-20 03:32:58,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,845 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 22 treesize of output 20 [2019-11-20 03:32:58,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:58,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:58,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 03:32:58,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:41 [2019-11-20 03:32:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:32:58,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [663471234] [2019-11-20 03:32:58,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:32:58,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 26 [2019-11-20 03:32:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6025645] [2019-11-20 03:32:58,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 03:32:58,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:32:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 03:32:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-11-20 03:32:58,926 INFO L87 Difference]: Start difference. First operand 461 states and 607 transitions. Second operand 27 states. [2019-11-20 03:33:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:01,938 INFO L93 Difference]: Finished difference Result 584 states and 752 transitions. [2019-11-20 03:33:01,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 03:33:01,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-11-20 03:33:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:01,940 INFO L225 Difference]: With dead ends: 584 [2019-11-20 03:33:01,940 INFO L226 Difference]: Without dead ends: 584 [2019-11-20 03:33:01,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 03:33:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-20 03:33:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 501. [2019-11-20 03:33:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-20 03:33:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 669 transitions. [2019-11-20 03:33:01,948 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 669 transitions. Word has length 48 [2019-11-20 03:33:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:01,949 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 669 transitions. [2019-11-20 03:33:01,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 03:33:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 669 transitions. [2019-11-20 03:33:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:33:01,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:01,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:02,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:33:02,154 INFO L410 AbstractCegarLoop]: === Iteration 25 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:33:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 720326571, now seen corresponding path program 1 times [2019-11-20 03:33:02,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:33:02,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [559165086] [2019-11-20 03:33:02,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:33:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:02,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 03:33:02,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:33:02,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 03:33:02,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:02,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 03:33:02,615 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 15 treesize of output 11 [2019-11-20 03:33:02,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:02,648 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 15 treesize of output 11 [2019-11-20 03:33:02,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:02,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2019-11-20 03:33:02,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-20 03:33:02,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:02,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 03:33:02,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:02,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:33:02,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2019-11-20 03:33:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:02,882 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:33:03,848 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 103 treesize of output 86 [2019-11-20 03:33:03,848 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:03,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:03,904 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 42 treesize of output 38 [2019-11-20 03:33:03,919 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 59 treesize of output 47 [2019-11-20 03:33:03,920 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:03,946 INFO L567 ElimStorePlain]: treesize reduction 23, result has 51.1 percent of original size [2019-11-20 03:33:03,946 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:04,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:04,032 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 22 treesize of output 20 [2019-11-20 03:33:04,048 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 44 treesize of output 38 [2019-11-20 03:33:04,048 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:04,066 INFO L567 ElimStorePlain]: treesize reduction 19, result has 50.0 percent of original size [2019-11-20 03:33:04,066 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:04,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:04,132 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 86 treesize of output 82 [2019-11-20 03:33:04,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,144 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 134 treesize of output 122 [2019-11-20 03:33:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,147 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:04,216 INFO L567 ElimStorePlain]: treesize reduction 54, result has 55.7 percent of original size [2019-11-20 03:33:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,217 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:04,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:04,286 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 68 treesize of output 64 [2019-11-20 03:33:04,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:04,312 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 99 treesize of output 87 [2019-11-20 03:33:04,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:04,313 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2019-11-20 03:33:04,393 INFO L567 ElimStorePlain]: treesize reduction 66, result has 38.3 percent of original size [2019-11-20 03:33:04,393 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 03:33:04,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:04,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-11-20 03:33:04,471 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-11-20 03:33:04,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:04,834 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 86 treesize of output 70 [2019-11-20 03:33:04,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:05,033 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 03:33:05,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:05,052 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 114 treesize of output 106 [2019-11-20 03:33:05,052 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:05,263 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 03:33:05,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:05,283 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 170 treesize of output 154 [2019-11-20 03:33:05,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:05,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:05,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:05,287 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:05,715 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-20 03:33:05,715 INFO L567 ElimStorePlain]: treesize reduction 88, result has 66.8 percent of original size [2019-11-20 03:33:05,739 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 68 treesize of output 60 [2019-11-20 03:33:05,740 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:05,962 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 03:33:05,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:05,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 03:33:05,963 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:197 [2019-11-20 03:33:06,468 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-11-20 03:33:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:33:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:07,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559165086] [2019-11-20 03:33:07,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:07,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2019-11-20 03:33:07,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953026464] [2019-11-20 03:33:07,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 03:33:07,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:33:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 03:33:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2019-11-20 03:33:07,534 INFO L87 Difference]: Start difference. First operand 501 states and 669 transitions. Second operand 29 states. [2019-11-20 03:33:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:14,411 INFO L93 Difference]: Finished difference Result 732 states and 971 transitions. [2019-11-20 03:33:14,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 03:33:14,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2019-11-20 03:33:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:14,415 INFO L225 Difference]: With dead ends: 732 [2019-11-20 03:33:14,415 INFO L226 Difference]: Without dead ends: 732 [2019-11-20 03:33:14,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 03:33:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-20 03:33:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 635. [2019-11-20 03:33:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-11-20 03:33:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 878 transitions. [2019-11-20 03:33:14,426 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 878 transitions. Word has length 48 [2019-11-20 03:33:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:14,426 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 878 transitions. [2019-11-20 03:33:14,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 03:33:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 878 transitions. [2019-11-20 03:33:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:33:14,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:14,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:14,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:33:14,636 INFO L410 AbstractCegarLoop]: === Iteration 26 === [append_oneErr1REQUIRES_VIOLATION, append_oneErr7REQUIRES_VIOLATION, append_oneErr6REQUIRES_VIOLATION, append_oneErr11REQUIRES_VIOLATION, append_oneErr10REQUIRES_VIOLATION, append_oneErr0REQUIRES_VIOLATION, append_oneErr5REQUIRES_VIOLATION, append_oneErr4REQUIRES_VIOLATION, append_oneErr9REQUIRES_VIOLATION, append_oneErr8REQUIRES_VIOLATION, append_oneErr2REQUIRES_VIOLATION, append_oneErr3REQUIRES_VIOLATION, remove_oneErr5REQUIRES_VIOLATION, remove_oneErr16REQUIRES_VIOLATION, remove_oneErr17REQUIRES_VIOLATION, remove_oneErr18REQUIRES_VIOLATION, remove_oneErr8ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr9REQUIRES_VIOLATION, remove_oneErr7ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr10REQUIRES_VIOLATION, remove_oneErr0REQUIRES_VIOLATION, remove_oneErr11REQUIRES_VIOLATION, remove_oneErr1REQUIRES_VIOLATION, remove_oneErr6ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr12REQUIRES_VIOLATION, remove_oneErr13REQUIRES_VIOLATION, remove_oneErr2REQUIRES_VIOLATION, remove_oneErr3REQUIRES_VIOLATION, remove_oneErr19ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr14REQUIRES_VIOLATION, remove_oneErr15REQUIRES_VIOLATION, remove_oneErr20ASSERT_VIOLATIONMEMORY_FREE, remove_oneErr4REQUIRES_VIOLATION, remove_oneErr21ASSERT_VIOLATIONMEMORY_FREE, create_itemErr1REQUIRES_VIOLATION, create_itemErr3REQUIRES_VIOLATION, create_itemErr0REQUIRES_VIOLATION, create_itemErr4REQUIRES_VIOLATION, create_itemErr5REQUIRES_VIOLATION, create_itemErr6REQUIRES_VIOLATION, create_itemErr2REQUIRES_VIOLATION, create_itemErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr6ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr0REQUIRES_VIOLATION, is_emptyErr1REQUIRES_VIOLATION, is_emptyErr2REQUIRES_VIOLATION, is_emptyErr3REQUIRES_VIOLATION, is_emptyErr4ASSERT_VIOLATIONMEMORY_FREE, is_emptyErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 03:33:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 722173612, now seen corresponding path program 1 times [2019-11-20 03:33:14,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:33:14,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [363083765] [2019-11-20 03:33:14,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_881dcbc4-227a-4ca4-b34d-7dbb02fabc63/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:33:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:14,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-20 03:33:14,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:33:14,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:14,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:33:14,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,026 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-11-20 03:33:15,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:36 [2019-11-20 03:33:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:33:15,099 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 39 treesize of output 37 [2019-11-20 03:33:15,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:33:15,105 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 41 treesize of output 37 [2019-11-20 03:33:15,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,157 INFO L567 ElimStorePlain]: treesize reduction 35, result has 47.0 percent of original size [2019-11-20 03:33:15,162 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 9 treesize of output 3 [2019-11-20 03:33:15,162 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:15,180 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 9 treesize of output 3 [2019-11-20 03:33:15,180 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:15,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:33:15,196 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:13 [2019-11-20 03:33:19,297 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 03:33:27,425 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 03:33:43,579 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 03:33:47,723 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 03:33:47,737 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:48,178 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 03:33:48,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:48,192 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:48,700 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 03:33:48,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:33:48,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-20 03:33:48,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:111, output treesize:141 [2019-11-20 03:33:57,239 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 03:34:01,912 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 03:34:30,132 WARN L191 SmtUtils]: Spent 8.89 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 03:34:50,952 WARN L191 SmtUtils]: Spent 6.83 s on a formula simplification that was a NOOP. DAG size: 104 [2019-11-20 03:34:50,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:34:50,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:34:50,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:34:51,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,126 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:34:51,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 114 [2019-11-20 03:34:51,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:51,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-11-20 03:34:51,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:51,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2019-11-20 03:34:51,229 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:51,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:34:51,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:34:51,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 145 [2019-11-20 03:34:51,269 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:51,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:34:51,271 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_58|], 14=[|v_#memory_$Pointer$.base_BEFORE_CALL_17|]} [2019-11-20 03:34:51,271 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.offset)_AFTER_CALL_58| vanished before elimination [2019-11-20 03:34:51,271 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_17| vanished before elimination [2019-11-20 03:34:51,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:34:51,271 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:507, output treesize:1 [2019-11-20 03:34:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:34:51,289 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:34:51,784 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 03:34:52,051 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 03:34:52,182 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 03:34:52,920 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 03:34:53,450 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 03:34:54,291 WARN L191 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 03:34:54,865 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 03:34:54,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:34:54,903 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:34:54,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:55,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:34:55,014 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:34:55,022 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:34:55,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:34:55,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-11-20 03:34:55,079 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:187, output treesize:99 [2019-11-20 03:35:00,219 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 03:35:05,997 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 03:35:16,111 WARN L191 SmtUtils]: Spent 5.24 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 03:35:29,339 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 03:35:45,328 WARN L191 SmtUtils]: Spent 5.35 s on a formula simplification that was a NOOP. DAG size: 96 [2019-11-20 03:35:45,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-20 03:37:12,897 WARN L191 SmtUtils]: Spent 1.21 m on a formula simplification that was a NOOP. DAG size: 155 [2019-11-20 03:37:13,459 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 03:37:13,724 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 03:37:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:37:13,850 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-20 03:37:14,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:37:14,482 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:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 03:37:14,486 INFO L168 Benchmark]: Toolchain (without parser) took 600141.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -84.7 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:37:14,487 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:37:14,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 892.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:37:14,487 INFO L168 Benchmark]: Boogie Preprocessor took 111.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:37:14,487 INFO L168 Benchmark]: RCFGBuilder took 1411.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:37:14,488 INFO L168 Benchmark]: TraceAbstraction took 597719.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 355.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:37:14,489 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.86 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 892.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1411.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 597719.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 355.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...