./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.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_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 c3fd3c6466616b2760d7784dc961566e83c949cf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:35:54,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:35:54,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:35:54,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:35:54,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:35:54,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:35:54,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:35:54,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:35:54,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:35:54,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:35:54,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:35:54,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:35:54,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:35:54,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:35:54,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:35:54,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:35:54,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:35:54,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:35:54,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:35:54,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:35:54,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:35:54,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:35:54,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:35:54,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:35:54,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:35:54,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:35:54,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:35:54,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:35:54,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:35:54,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:35:54,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:35:54,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:35:54,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:35:54,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:35:54,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:35:54,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:35:54,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:35:54,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:35:54,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:35:54,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:35:54,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:35:54,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 02:35:54,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:35:54,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:35:54,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:35:54,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:35:54,435 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:35:54,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:35:54,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:35:54,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:35:54,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:35:54,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:35:54,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:35:54,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 02:35:54,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 02:35:54,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 02:35:54,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:35:54,437 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:35:54,437 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:35:54,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:35:54,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:35:54,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:35:54,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:35:54,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:35:54,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:35:54,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:35:54,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:35:54,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:35:54,450 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:35:54,450 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:35:54,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:35:54,451 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_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 -> c3fd3c6466616b2760d7784dc961566e83c949cf [2019-11-20 02:35:54,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:35:54,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:35:54,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:35:54,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:35:54,646 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:35:54,646 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-11-20 02:35:54,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/data/503937cd8/1bac81da1b3a46f9a122b9fdc13806ba/FLAGab428718b [2019-11-20 02:35:55,201 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:35:55,201 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-11-20 02:35:55,215 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/data/503937cd8/1bac81da1b3a46f9a122b9fdc13806ba/FLAGab428718b [2019-11-20 02:35:55,490 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/bin/uautomizer/data/503937cd8/1bac81da1b3a46f9a122b9fdc13806ba [2019-11-20 02:35:55,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:35:55,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 02:35:55,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:35:55,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:35:55,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:35:55,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:55" (1/1) ... [2019-11-20 02:35:55,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1596304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:55, skipping insertion in model container [2019-11-20 02:35:55,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:55" (1/1) ... [2019-11-20 02:35:55,508 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:35:55,546 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:35:55,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:35:55,980 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:35:56,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:35:56,101 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:35:56,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56 WrapperNode [2019-11-20 02:35:56,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:35:56,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:35:56,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:35:56,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:35:56,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... [2019-11-20 02:35:56,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:35:56,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:35:56,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:35:56,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:35:56,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:35:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 02:35:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 02:35:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 02:35:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 02:35:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 02:35:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 02:35:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 02:35:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 02:35:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 02:35:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 02:35:56,240 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 02:35:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 02:35:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 02:35:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 02:35:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 02:35:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 02:35:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 02:35:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 02:35:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 02:35:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 02:35:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 02:35:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 02:35:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 02:35:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 02:35:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 02:35:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 02:35:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 02:35:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 02:35:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 02:35:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 02:35:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 02:35:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 02:35:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 02:35:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 02:35:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 02:35:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 02:35:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 02:35:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 02:35:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 02:35:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 02:35:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 02:35:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 02:35:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 02:35:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 02:35:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 02:35:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 02:35:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 02:35:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 02:35:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 02:35:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 02:35:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 02:35:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 02:35:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 02:35:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 02:35:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 02:35:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 02:35:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 02:35:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 02:35:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 02:35:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 02:35:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 02:35:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 02:35:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 02:35:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 02:35:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 02:35:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 02:35:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 02:35:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 02:35:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 02:35:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 02:35:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 02:35:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 02:35:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 02:35:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 02:35:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 02:35:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 02:35:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 02:35:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 02:35:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 02:35:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 02:35:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 02:35:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:35:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:35:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:35:57,102 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:35:57,103 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 02:35:57,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:57 BoogieIcfgContainer [2019-11-20 02:35:57,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:35:57,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:35:57,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:35:57,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:35:57,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:35:55" (1/3) ... [2019-11-20 02:35:57,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee8c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:57, skipping insertion in model container [2019-11-20 02:35:57,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:56" (2/3) ... [2019-11-20 02:35:57,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee8c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:57, skipping insertion in model container [2019-11-20 02:35:57,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:57" (3/3) ... [2019-11-20 02:35:57,116 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2019-11-20 02:35:57,125 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:35:57,133 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 02:35:57,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 02:35:57,164 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:35:57,164 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 02:35:57,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:35:57,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:35:57,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:35:57,165 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:35:57,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:35:57,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:35:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 02:35:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 02:35:57,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:35:57,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:35:57,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:35:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:35:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 02:35:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:35:57,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1684364838] [2019-11-20 02:35:57,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:35:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:35:57,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 02:35:57,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:35:57,464 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 02:35:57,465 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:35:57,479 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 02:35:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1684364838] [2019-11-20 02:35:57,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:35:57,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:35:57,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689856640] [2019-11-20 02:35:57,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 02:35:57,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:35:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:35:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:35:57,504 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 02:35:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:35:57,530 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 02:35:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:35:57,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 02:35:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:35:57,552 INFO L225 Difference]: With dead ends: 110 [2019-11-20 02:35:57,552 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 02:35:57,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:35:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 02:35:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 02:35:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 02:35:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 02:35:57,600 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 02:35:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:35:57,601 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 02:35:57,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 02:35:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 02:35:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 02:35:57,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:35:57,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:35:57,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:35:57,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:35:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:35:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 02:35:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:35:57,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1313287951] [2019-11-20 02:35:57,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:35:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:35:58,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:35:58,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:35:58,046 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 02:35:58,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:58,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:58,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:35:58,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:35:58,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:58,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 02:35:58,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:58,146 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 02:35:58,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:58,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 02:35:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:35:58,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:35:58,200 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 02:35:58,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1313287951] [2019-11-20 02:35:58,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:35:58,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 02:35:58,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87909066] [2019-11-20 02:35:58,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:35:58,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:35:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:35:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:35:58,204 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 02:35:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:35:58,807 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 02:35:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:35:58,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 02:35:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:35:58,812 INFO L225 Difference]: With dead ends: 116 [2019-11-20 02:35:58,812 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 02:35:58,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:35:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 02:35:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 02:35:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 02:35:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 02:35:58,837 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 02:35:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:35:58,837 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 02:35:58,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:35:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 02:35:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 02:35:58,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:35:58,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:35:59,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:35:59,046 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:35:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:35:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 02:35:59,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:35:59,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [628629114] [2019-11-20 02:35:59,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:35:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:35:59,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:35:59,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:35:59,274 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 02:35:59,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:59,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:59,296 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 02:35:59,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:59,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:59,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:35:59,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:35:59,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:35:59,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 02:35:59,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:59,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:59,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:35:59,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:35:59,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:59,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:59,407 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 02:35:59,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 02:35:59,431 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 02:35:59,431 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:35:59,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:35:59,778 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 02:35:59,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [628629114] [2019-11-20 02:35:59,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:35:59,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 02:35:59,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15493918] [2019-11-20 02:35:59,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:35:59,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:35:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:35:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:35:59,780 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 02:36:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:03,253 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 02:36:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:36:03,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 02:36:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:03,256 INFO L225 Difference]: With dead ends: 115 [2019-11-20 02:36:03,256 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 02:36:03,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:36:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 02:36:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 02:36:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 02:36:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 02:36:03,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 02:36:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 02:36:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:36:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 02:36:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 02:36:03,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:03,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:03,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:03,471 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 02:36:03,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:03,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [823379080] [2019-11-20 02:36:03,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:03,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:36:03,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:03,694 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 02:36:03,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:03,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:03,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:03,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:36:03,722 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 02:36:03,722 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:03,754 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 02:36:03,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [823379080] [2019-11-20 02:36:03,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 02:36:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248433048] [2019-11-20 02:36:03,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:36:03,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:36:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:03,756 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 02:36:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:03,931 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 02:36:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:36:03,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 02:36:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:03,932 INFO L225 Difference]: With dead ends: 108 [2019-11-20 02:36:03,933 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 02:36:03,933 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 02:36:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 02:36:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 02:36:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 02:36:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 02:36:03,943 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 02:36:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:03,943 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 02:36:03,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:36:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 02:36:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 02:36:03,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:03,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:04,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:04,147 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 02:36:04,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:04,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1849550896] [2019-11-20 02:36:04,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:04,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:36:04,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:04,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 02:36:04,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:04,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:04,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:04,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:36:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:36:04,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:04,364 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 02:36:04,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849550896] [2019-11-20 02:36:04,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:04,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 02:36:04,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186874868] [2019-11-20 02:36:04,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:36:04,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:36:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:04,366 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 02:36:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:04,758 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 02:36:04,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:36:04,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 02:36:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:04,760 INFO L225 Difference]: With dead ends: 107 [2019-11-20 02:36:04,760 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 02:36:04,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 02:36:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 02:36:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 02:36:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 02:36:04,769 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 02:36:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:04,769 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 02:36:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:36:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 02:36:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:36:04,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:04,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:04,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:04,974 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 02:36:04,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:04,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [562772666] [2019-11-20 02:36:04,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:05,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:36:05,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:05,182 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 02:36:05,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:05,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:05,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:05,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:36:05,187 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 02:36:05,187 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:05,196 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 02:36:05,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [562772666] [2019-11-20 02:36:05,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:05,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:36:05,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080932748] [2019-11-20 02:36:05,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:36:05,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:36:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:36:05,198 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 02:36:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:05,328 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 02:36:05,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:36:05,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 02:36:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:05,329 INFO L225 Difference]: With dead ends: 105 [2019-11-20 02:36:05,330 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 02:36:05,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:36:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 02:36:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 02:36:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 02:36:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 02:36:05,339 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 02:36:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:05,340 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 02:36:05,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:36:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 02:36:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:36:05,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:05,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:05,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:05,542 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:05,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 02:36:05,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:05,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [633797756] [2019-11-20 02:36:05,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:05,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:36:05,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:05,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 02:36:05,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:05,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:05,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:05,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:36:05,731 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 02:36:05,731 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:05,766 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 02:36:05,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [633797756] [2019-11-20 02:36:05,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:05,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 02:36:05,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150758953] [2019-11-20 02:36:05,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:36:05,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:36:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:05,768 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 02:36:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:06,132 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 02:36:06,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:36:06,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 02:36:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:06,133 INFO L225 Difference]: With dead ends: 106 [2019-11-20 02:36:06,133 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 02:36:06,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 02:36:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 02:36:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 02:36:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 02:36:06,141 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 02:36:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:06,141 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 02:36:06,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:36:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 02:36:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 02:36:06,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:06,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:06,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:06,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 02:36:06,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:06,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1408040634] [2019-11-20 02:36:06,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:06,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 02:36:06,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:06,502 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 02:36:06,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:06,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:06,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:06,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:36:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:36:06,524 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:36:06,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408040634] [2019-11-20 02:36:06,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:06,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 02:36:06,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346303925] [2019-11-20 02:36:06,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:36:06,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:36:06,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:36:06,586 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 02:36:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:06,995 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 02:36:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:36:06,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 02:36:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:06,997 INFO L225 Difference]: With dead ends: 135 [2019-11-20 02:36:06,997 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 02:36:06,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:36:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 02:36:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 02:36:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 02:36:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 02:36:07,003 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 02:36:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:07,003 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 02:36:07,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:36:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 02:36:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 02:36:07,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:07,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:07,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:07,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 02:36:07,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:07,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2077196869] [2019-11-20 02:36:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:07,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:36:07,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:07,380 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 02:36:07,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:07,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:07,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:07,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:36:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:36:07,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:07,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:36:07,482 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 02:36:07,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2077196869] [2019-11-20 02:36:07,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:07,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 02:36:07,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730940559] [2019-11-20 02:36:07,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:36:07,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:36:07,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:36:07,484 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 02:36:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:08,047 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 02:36:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:36:08,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 02:36:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:08,050 INFO L225 Difference]: With dead ends: 109 [2019-11-20 02:36:08,050 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 02:36:08,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:36:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 02:36:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 02:36:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 02:36:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 02:36:08,055 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 02:36:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:08,055 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 02:36:08,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:36:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 02:36:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 02:36:08,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:08,057 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 02:36:08,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:08,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 02:36:08,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1897797704] [2019-11-20 02:36:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:08,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:36:08,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:08,495 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 02:36:08,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:08,532 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 02:36:08,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897797704] [2019-11-20 02:36:08,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:08,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:36:08,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374512414] [2019-11-20 02:36:08,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:36:08,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:08,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:36:08,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:36:08,533 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 02:36:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:08,907 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 02:36:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:36:08,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 02:36:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:08,910 INFO L225 Difference]: With dead ends: 135 [2019-11-20 02:36:08,910 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 02:36:08,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:36:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 02:36:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 02:36:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 02:36:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 02:36:08,915 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 02:36:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:08,916 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 02:36:08,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:36:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 02:36:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 02:36:08,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:08,917 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 02:36:09,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:09,118 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 02:36:09,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:09,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [724927911] [2019-11-20 02:36:09,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:09,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 02:36:09,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:09,385 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 02:36:09,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:36:09,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 02:36:09,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724927911] [2019-11-20 02:36:09,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 02:36:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244845316] [2019-11-20 02:36:09,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:36:09,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:36:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:36:09,474 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 02:36:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:10,388 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 02:36:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:36:10,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 02:36:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:10,390 INFO L225 Difference]: With dead ends: 104 [2019-11-20 02:36:10,390 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 02:36:10,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:36:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 02:36:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 02:36:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 02:36:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 02:36:10,393 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 02:36:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:10,394 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 02:36:10,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:36:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 02:36:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 02:36:10,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:10,395 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 02:36:10,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:10,596 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 02:36:10,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:10,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1204398924] [2019-11-20 02:36:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:10,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:36:10,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:10,773 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 02:36:10,773 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:10,787 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 02:36:10,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1204398924] [2019-11-20 02:36:10,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:10,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:36:10,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938444900] [2019-11-20 02:36:10,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:36:10,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:36:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:10,789 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 02:36:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:10,826 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 02:36:10,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:36:10,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 02:36:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:10,828 INFO L225 Difference]: With dead ends: 112 [2019-11-20 02:36:10,828 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 02:36:10,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:36:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 02:36:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 02:36:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 02:36:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 02:36:10,833 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 02:36:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:10,833 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 02:36:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:36:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 02:36:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:36:10,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:10,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:11,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:11,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 02:36:11,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:11,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1464045033] [2019-11-20 02:36:11,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:11,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:36:11,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:11,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 02:36:11,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:11,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:11,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:11,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:36:11,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:36:11,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:11,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:11,276 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 02:36:11,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 02:36:11,302 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 02:36:11,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:11,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:11,307 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 02:36:11,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 02:36:11,323 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 02:36:11,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:11,339 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 02:36:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1464045033] [2019-11-20 02:36:11,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:11,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 02:36:11,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13863553] [2019-11-20 02:36:11,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:36:11,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:36:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:36:11,340 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 02:36:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:11,679 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 02:36:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:36:11,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 02:36:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:11,681 INFO L225 Difference]: With dead ends: 114 [2019-11-20 02:36:11,681 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 02:36:11,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:36:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 02:36:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 02:36:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 02:36:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 02:36:11,685 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 02:36:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:11,685 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 02:36:11,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:36:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 02:36:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:36:11,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:11,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:11,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:11,889 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 02:36:11,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:11,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1790183402] [2019-11-20 02:36:11,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:12,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:36:12,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:12,074 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 02:36:12,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:12,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:36:12,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:36:12,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:12,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:36:12,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:12,120 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 02:36:12,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 02:36:12,166 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 02:36:12,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:12,192 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 02:36:12,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:12,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:12,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-20 02:36:12,214 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 02:36:12,214 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:12,568 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 02:36:12,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1790183402] [2019-11-20 02:36:12,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:12,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 02:36:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910859837] [2019-11-20 02:36:12,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:36:12,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:36:12,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:36:12,570 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 02:36:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:36:14,277 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 02:36:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:36:14,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 02:36:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:36:14,280 INFO L225 Difference]: With dead ends: 113 [2019-11-20 02:36:14,280 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 02:36:14,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 02:36:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 02:36:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 02:36:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 02:36:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 02:36:14,285 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 02:36:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:36:14,285 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 02:36:14,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:36:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 02:36:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:36:14,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:36:14,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:36:14,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:36:14,492 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:36:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:36:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 02:36:14,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:36:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [126350115] [2019-11-20 02:36:14,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:36:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:36:14,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 02:36:14,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:36:14,690 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 02:36:14,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:14,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:14,700 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 02:36:14,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:14,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:14,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:36:14,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:36:14,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:36:14,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 02:36:14,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:14,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:14,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:14,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 02:36:14,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:36:14,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:36:14,804 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 02:36:14,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-20 02:36:14,831 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 02:36:14,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:36:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:36:15,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:15,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:36:15,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:15,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:15,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:36:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:20,454 WARN L191 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 02:36:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:36:22,839 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 02:36:22,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [126350115] [2019-11-20 02:36:22,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:36:22,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 02:36:22,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766615067] [2019-11-20 02:36:22,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:36:22,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:36:22,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:36:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 02:36:22,842 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 02:36:29,003 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-20 02:36:41,643 WARN L191 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 02:37:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:37:03,915 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-20 02:37:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:37:03,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 02:37:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:37:03,917 INFO L225 Difference]: With dead ends: 129 [2019-11-20 02:37:03,917 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 02:37:03,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=43, Invalid=114, Unknown=3, NotChecked=22, Total=182 [2019-11-20 02:37:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 02:37:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-20 02:37:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 02:37:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 02:37:03,922 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 02:37:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:37:03,923 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 02:37:03,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:37:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 02:37:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:37:03,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:37:03,924 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 02:37:04,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:37:04,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:37:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:37:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 02:37:04,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:37:04,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1614664017] [2019-11-20 02:37:04,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:37:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:37:04,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:37:04,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:37:04,300 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 02:37:04,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:04,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 02:37:04,320 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 02:37:04,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:37:04,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:04,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-20 02:37:04,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:04,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:04,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 02:37:04,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 02:37:04,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:04,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:37:04,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 02:37:04,376 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 02:37:04,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1614664017] [2019-11-20 02:37:04,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:37:04,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 02:37:04,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393100503] [2019-11-20 02:37:04,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:37:04,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:37:04,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:37:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:37:04,377 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 02:37:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:37:04,615 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 02:37:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:37:04,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 02:37:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:37:04,617 INFO L225 Difference]: With dead ends: 112 [2019-11-20 02:37:04,617 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 02:37:04,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:37:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 02:37:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 02:37:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 02:37:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 02:37:04,623 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 02:37:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:37:04,623 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 02:37:04,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:37:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 02:37:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:37:04,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:37:04,624 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 02:37:04,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:37:04,827 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:37:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:37:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 02:37:04,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:37:04,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1498173339] [2019-11-20 02:37:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:37:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:37:04,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:37:05,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:37:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:37:05,065 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:37:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:05,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 02:37:05,211 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 02:37:05,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 02:37:05,217 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 02:37:05,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:05,240 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 02:37:05,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 02:37:05,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:05,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-20 02:37:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,353 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 02:37:05,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,397 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 02:37:05,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 02:37:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:06,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:06,151 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 02:37:06,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498173339] [2019-11-20 02:37:06,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:37:06,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 02:37:06,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763845753] [2019-11-20 02:37:06,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:37:06,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:37:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:37:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:37:06,152 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 02:37:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:37:06,514 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 02:37:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:37:06,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 02:37:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:37:06,516 INFO L225 Difference]: With dead ends: 106 [2019-11-20 02:37:06,516 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 02:37:06,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:37:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 02:37:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 02:37:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 02:37:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 02:37:06,521 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 02:37:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:37:06,521 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 02:37:06,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:37:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 02:37:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:37:06,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:37:06,522 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 02:37:06,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:37:06,723 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:37:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:37:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 02:37:06,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:37:06,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [730069842] [2019-11-20 02:37:06,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:37:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:37:06,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 02:37:06,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:37:06,933 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 02:37:06,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:06,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:06,946 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 02:37:06,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:06,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:06,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:37:06,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:37:07,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:07,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 02:37:07,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:07,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:07,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 02:37:07,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:07,046 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 02:37:07,047 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 02:37:07,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 02:37:07,170 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 02:37:07,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:07,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 02:37:07,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:07,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:07,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:07,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 02:37:07,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:07,262 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-20 02:37:07,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:37:07,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2019-11-20 02:37:07,275 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 02:37:07,275 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:37:07,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:07,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:07,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:07,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:07,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:07,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:07,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:07,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:10,781 WARN L191 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 02:37:10,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:37:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:37:13,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:13,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 02:37:13,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:37:13,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:37:13,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:37:13,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 02:37:13,814 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 02:37:13,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [730069842] [2019-11-20 02:37:13,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:37:13,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-20 02:37:13,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075581216] [2019-11-20 02:37:13,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 02:37:13,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:37:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 02:37:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-20 02:37:13,819 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-20 02:37:18,046 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (forall ((|v_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)))))))) (= (bvadd (select |c_#length| c_append_~pointerToList.base) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) c_append_~pointerToList.offset) (exists ((|append_#t~malloc12.base| (_ BitVec 32))) (= (bvadd (select |c_#length| |append_#t~malloc12.base|) (_ bv4294967288 32)) (_ bv0 32))) (= (bvadd (select |c_#valid| |c_append_#in~pointerToList.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv4 32) (select |c_#length| |c_append_#in~pointerToList.base|)) (= (_ bv0 32) |c_append_#in~pointerToList.offset|) (= (_ bv1 1) (select |c_#valid| c_append_~pointerToList.base))) is different from false [2019-11-20 02:37:34,584 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 02:38:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:38:23,584 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-11-20 02:38:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:38:23,585 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 02:38:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:38:23,586 INFO L225 Difference]: With dead ends: 126 [2019-11-20 02:38:23,586 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 02:38:23,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=59, Invalid=244, Unknown=7, NotChecked=32, Total=342 [2019-11-20 02:38:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 02:38:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-11-20 02:38:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 02:38:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-20 02:38:23,591 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 22 [2019-11-20 02:38:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:38:23,591 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-20 02:38:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 02:38:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-20 02:38:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 02:38:23,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:38:23,593 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:38:23,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:38:23,793 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 02:38:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:38:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-20 02:38:23,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:38:23,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1120020263] [2019-11-20 02:38:23,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3ed077d-59af-427f-85f3-9fbebe5833b2/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 02:38:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:23,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 02:38:24,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:38:24,007 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 02:38:24,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,016 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 02:38:24,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:38:24,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 02:38:24,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 02:38:24,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,177 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 02:38:24,177 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 02:38:24,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-20 02:38:24,226 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-20 02:38:24,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 02:38:24,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 02:38:24,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,300 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 02:38:24,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:38:24,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-20 02:38:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:38:24,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:38:24,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:24,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:24,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-20 02:38:24,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2019-11-20 02:38:24,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2019-11-20 02:38:24,840 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:38:24,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:38:24,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 02:38:24,913 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-20 02:38:25,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:25,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:25,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:25,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:25,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:25,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:25,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:38:25,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 02:38:25,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 02:38:26,561 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 02:38:26,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 02:38:26,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 02:38:26,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 02:38:26,574 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 02:38:26,604 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 02:38:26,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:26,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:38:26,746 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-20 02:38:26,754 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 02:38:26,759 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-20 02:38:26,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:38:26,962 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:38:26,966 INFO L168 Benchmark]: Toolchain (without parser) took 151472.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:38:26,967 INFO L168 Benchmark]: CDTParser took 0.62 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 02:38:26,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:38:26,967 INFO L168 Benchmark]: Boogie Preprocessor took 75.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:38:26,967 INFO L168 Benchmark]: RCFGBuilder took 925.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:38:26,968 INFO L168 Benchmark]: TraceAbstraction took 149860.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -63.8 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:38:26,970 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.62 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 607.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 925.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149860.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -63.8 MB). Peak memory consumption was 47.9 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...