./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 06:18:12,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:18:12,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:18:12,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:18:12,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:18:12,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:18:12,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:18:12,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:18:12,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:18:12,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:18:12,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:18:12,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:18:12,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:18:12,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:18:12,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:18:12,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:18:12,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:18:12,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:18:12,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:18:12,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:18:12,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:18:12,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:18:12,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:18:12,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:18:12,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:18:12,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:18:12,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:18:12,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:18:12,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:18:12,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:18:12,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:18:12,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:18:12,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:18:12,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:18:12,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:18:12,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:18:12,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:18:12,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:18:12,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:18:12,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:18:12,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:18:12,067 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 06:18:12,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:18:12,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:18:12,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:18:12,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:18:12,085 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:18:12,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:18:12,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:18:12,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 06:18:12,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:18:12,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:18:12,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:18:12,088 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 06:18:12,088 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 06:18:12,089 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 06:18:12,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:18:12,089 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 06:18:12,089 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 06:18:12,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:18:12,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:18:12,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:18:12,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:18:12,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:18:12,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:18:12,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:18:12,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:18:12,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:18:12,092 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 06:18:12,093 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 06:18:12,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 06:18:12,093 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_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-11-20 06:18:12,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:18:12,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:18:12,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:18:12,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:18:12,243 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:18:12,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-20 06:18:12,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/data/b3c46fd0a/7e5f30ecd3a9448484927a34e95c289d/FLAG3c5e64b8d [2019-11-20 06:18:12,725 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:18:12,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-20 06:18:12,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/data/b3c46fd0a/7e5f30ecd3a9448484927a34e95c289d/FLAG3c5e64b8d [2019-11-20 06:18:13,076 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/bin/uautomizer/data/b3c46fd0a/7e5f30ecd3a9448484927a34e95c289d [2019-11-20 06:18:13,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:18:13,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 06:18:13,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:18:13,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:18:13,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:18:13,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e05a64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13, skipping insertion in model container [2019-11-20 06:18:13,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,094 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:18:13,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:18:13,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:18:13,547 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:18:13,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:18:13,644 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:18:13,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13 WrapperNode [2019-11-20 06:18:13,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:18:13,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:18:13,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:18:13,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:18:13,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... [2019-11-20 06:18:13,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:18:13,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:18:13,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:18:13,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:18:13,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 06:18:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 06:18:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 06:18:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 06:18:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 06:18:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 06:18:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 06:18:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 06:18:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 06:18:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 06:18:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 06:18:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 06:18:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 06:18:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 06:18:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 06:18:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 06:18:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 06:18:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 06:18:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 06:18:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 06:18:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 06:18:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 06:18:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 06:18:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 06:18:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 06:18:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 06:18:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 06:18:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 06:18:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 06:18:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 06:18:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:18:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 06:18:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 06:18:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 06:18:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:18:14,443 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:18:14,443 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 06:18:14,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:18:14 BoogieIcfgContainer [2019-11-20 06:18:14,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:18:14,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:18:14,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:18:14,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:18:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:18:13" (1/3) ... [2019-11-20 06:18:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7516892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:18:14, skipping insertion in model container [2019-11-20 06:18:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:18:13" (2/3) ... [2019-11-20 06:18:14,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7516892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:18:14, skipping insertion in model container [2019-11-20 06:18:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:18:14" (3/3) ... [2019-11-20 06:18:14,452 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-11-20 06:18:14,462 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:18:14,470 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-11-20 06:18:14,489 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-11-20 06:18:14,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:18:14,511 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 06:18:14,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:18:14,511 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:18:14,511 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:18:14,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:18:14,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:18:14,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:18:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-20 06:18:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:18:14,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:14,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:14,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash 264873749, now seen corresponding path program 1 times [2019-11-20 06:18:14,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:14,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1723920760] [2019-11-20 06:18:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:14,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:18:14,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:14,897 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 06:18:14,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:14,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:14,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:14,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:18:14,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:14,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 06:18:14,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:14,984 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 06:18:14,985 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 06:18:14,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-20 06:18:15,012 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 06:18:15,012 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:15,096 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 06:18:15,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723920760] [2019-11-20 06:18:15,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:15,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 06:18:15,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195278220] [2019-11-20 06:18:15,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:18:15,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:18:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:18:15,122 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 8 states. [2019-11-20 06:18:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:15,721 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-11-20 06:18:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:18:15,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 06:18:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:15,737 INFO L225 Difference]: With dead ends: 94 [2019-11-20 06:18:15,737 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 06:18:15,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:18:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 06:18:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-11-20 06:18:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 06:18:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-11-20 06:18:15,799 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-11-20 06:18:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:15,799 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-11-20 06:18:15,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:18:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-11-20 06:18:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:18:15,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:15,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:16,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:16,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash 264873750, now seen corresponding path program 1 times [2019-11-20 06:18:16,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [147738558] [2019-11-20 06:18:16,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:16,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 06:18:16,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:16,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 06:18:16,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:16,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:16,246 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 06:18:16,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:16,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:16,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:16,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 06:18:16,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:16,299 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 06:18:16,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:16,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:16,323 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 06:18:16,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:16,343 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-20 06:18:16,344 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 06:18:16,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-20 06:18:16,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 06:18:16,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:16,705 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 06:18:16,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147738558] [2019-11-20 06:18:16,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:16,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 06:18:16,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595297632] [2019-11-20 06:18:16,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:18:16,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:18:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:18:16,708 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2019-11-20 06:18:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:19,937 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-20 06:18:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:18:19,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 06:18:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:19,942 INFO L225 Difference]: With dead ends: 125 [2019-11-20 06:18:19,943 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 06:18:19,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:18:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 06:18:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2019-11-20 06:18:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 06:18:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-20 06:18:19,956 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2019-11-20 06:18:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:19,956 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-20 06:18:19,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:18:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-20 06:18:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 06:18:19,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:19,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:20,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:20,158 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash -378848291, now seen corresponding path program 1 times [2019-11-20 06:18:20,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:20,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [777988251] [2019-11-20 06:18:20,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:20,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:18:20,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:20,366 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 06:18:20,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:20,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:20,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:20,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 06:18:20,389 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 06:18:20,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:20,425 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 06:18:20,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777988251] [2019-11-20 06:18:20,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:20,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 06:18:20,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580054404] [2019-11-20 06:18:20,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:18:20,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:18:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:18:20,427 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 4 states. [2019-11-20 06:18:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:20,589 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-20 06:18:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:18:20,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 06:18:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:20,606 INFO L225 Difference]: With dead ends: 91 [2019-11-20 06:18:20,607 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 06:18:20,607 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 06:18:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 06:18:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-20 06:18:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 06:18:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-11-20 06:18:20,624 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-11-20 06:18:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:20,624 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-11-20 06:18:20,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:18:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-11-20 06:18:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 06:18:20,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:20,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:20,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:20,826 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -378848290, now seen corresponding path program 1 times [2019-11-20 06:18:20,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:20,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [215877823] [2019-11-20 06:18:20,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:21,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:18:21,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:21,012 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 06:18:21,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:18:21,024 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 06:18:21,024 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:21,051 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 06:18:21,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [215877823] [2019-11-20 06:18:21,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:21,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 06:18:21,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129953221] [2019-11-20 06:18:21,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:18:21,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:21,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:18:21,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:18:21,053 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 4 states. [2019-11-20 06:18:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:21,221 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-11-20 06:18:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:18:21,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 06:18:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:21,223 INFO L225 Difference]: With dead ends: 87 [2019-11-20 06:18:21,223 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 06:18:21,223 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 06:18:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 06:18:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-20 06:18:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 06:18:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-11-20 06:18:21,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2019-11-20 06:18:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:21,232 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-11-20 06:18:21,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:18:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-11-20 06:18:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 06:18:21,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:21,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:21,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:21,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1834413344, now seen corresponding path program 1 times [2019-11-20 06:18:21,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:21,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1395123221] [2019-11-20 06:18:21,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:21,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 06:18:21,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:21,770 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 06:18:21,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 06:18:21,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,820 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 06:18:21,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 06:18:21,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:21,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-11-20 06:18:21,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-20 06:18:21,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-20 06:18:21,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:21,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:21,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-11-20 06:18:21,942 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 06:18:21,942 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:22,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1395123221] [2019-11-20 06:18:22,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:22,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 06:18:22,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124857767] [2019-11-20 06:18:22,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 06:18:22,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 06:18:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:18:22,093 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 13 states. [2019-11-20 06:18:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:22,735 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-20 06:18:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 06:18:22,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-20 06:18:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:22,737 INFO L225 Difference]: With dead ends: 99 [2019-11-20 06:18:22,737 INFO L226 Difference]: Without dead ends: 99 [2019-11-20 06:18:22,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-20 06:18:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-20 06:18:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2019-11-20 06:18:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 06:18:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-20 06:18:22,747 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2019-11-20 06:18:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:22,747 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-20 06:18:22,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 06:18:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-20 06:18:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:18:22,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:22,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:22,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:22,952 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash -859911281, now seen corresponding path program 1 times [2019-11-20 06:18:22,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:22,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1953415466] [2019-11-20 06:18:22,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:23,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 06:18:23,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:23,160 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 06:18:23,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:23,189 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 06:18:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1953415466] [2019-11-20 06:18:23,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:23,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 06:18:23,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514042215] [2019-11-20 06:18:23,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:18:23,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:18:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:18:23,191 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2019-11-20 06:18:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:23,283 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-20 06:18:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:18:23,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-20 06:18:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:23,286 INFO L225 Difference]: With dead ends: 140 [2019-11-20 06:18:23,286 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 06:18:23,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:18:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 06:18:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2019-11-20 06:18:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 06:18:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2019-11-20 06:18:23,296 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 24 [2019-11-20 06:18:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:23,297 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2019-11-20 06:18:23,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:18:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2019-11-20 06:18:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:18:23,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:23,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:23,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:23,501 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash -861133477, now seen corresponding path program 1 times [2019-11-20 06:18:23,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:23,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [925003100] [2019-11-20 06:18:23,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:23,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 06:18:23,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:23,698 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 06:18:23,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:23,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:23,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:23,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 06:18:23,730 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 11 treesize of output 7 [2019-11-20 06:18:23,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:23,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:23,741 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 06:18:23,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 06:18:23,788 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 11 [2019-11-20 06:18:23,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:23,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:23,797 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 06:18:23,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-20 06:18:23,820 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 06:18:23,820 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:23,921 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 32 treesize of output 28 [2019-11-20 06:18:23,922 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 06:18:23,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:23,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:23,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 06:18:24,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:24,022 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 10 treesize of output 8 [2019-11-20 06:18:24,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:24,026 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 10 treesize of output 8 [2019-11-20 06:18:24,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:24,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:24,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 06:18:24,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 06:18:24,036 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 06:18:24,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [925003100] [2019-11-20 06:18:24,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:24,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-20 06:18:24,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680538052] [2019-11-20 06:18:24,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:18:24,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:18:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:18:24,038 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 10 states. [2019-11-20 06:18:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:24,537 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-20 06:18:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:18:24,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 06:18:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:24,538 INFO L225 Difference]: With dead ends: 106 [2019-11-20 06:18:24,538 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 06:18:24,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:18:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 06:18:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-11-20 06:18:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 06:18:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2019-11-20 06:18:24,545 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2019-11-20 06:18:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:24,546 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2019-11-20 06:18:24,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:18:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2019-11-20 06:18:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:18:24,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:24,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:24,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:24,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash -861133476, now seen corresponding path program 1 times [2019-11-20 06:18:24,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:24,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1615445309] [2019-11-20 06:18:24,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:24,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 06:18:24,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:24,998 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 11 treesize of output 7 [2019-11-20 06:18:24,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,015 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 11 treesize of output 7 [2019-11-20 06:18:25,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,042 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 06:18:25,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-20 06:18:25,116 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 17 treesize of output 9 [2019-11-20 06:18:25,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,136 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 15 treesize of output 7 [2019-11-20 06:18:25,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,143 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 06:18:25,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-20 06:18:25,167 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 06:18:25,167 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:25,536 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 28 treesize of output 24 [2019-11-20 06:18:25,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 06:18:25,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,605 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:25,644 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:25,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-20 06:18:25,670 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-20 06:18:25,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 06:18:25,743 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 06:18:25,744 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 06:18:25,754 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 16 treesize of output 12 [2019-11-20 06:18:25,755 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 06:18:25,765 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 06:18:25,766 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:25,794 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 06:18:25,794 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:25,806 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 06:18:25,806 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:25,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:25,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-20 06:18:25,900 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:67, output treesize:55 [2019-11-20 06:18:26,142 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-11-20 06:18:26,157 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 06:18:26,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1615445309] [2019-11-20 06:18:26,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:26,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-20 06:18:26,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454461070] [2019-11-20 06:18:26,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 06:18:26,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:26,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 06:18:26,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:18:26,159 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 13 states. [2019-11-20 06:18:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:27,148 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-11-20 06:18:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:18:27,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-20 06:18:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:27,150 INFO L225 Difference]: With dead ends: 108 [2019-11-20 06:18:27,150 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 06:18:27,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-20 06:18:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 06:18:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-11-20 06:18:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 06:18:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-11-20 06:18:27,159 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 24 [2019-11-20 06:18:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:27,159 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-11-20 06:18:27,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 06:18:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-11-20 06:18:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 06:18:27,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:27,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:27,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:27,364 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash -187734405, now seen corresponding path program 1 times [2019-11-20 06:18:27,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:27,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1175092075] [2019-11-20 06:18:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:27,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 06:18:27,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:27,585 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 11 treesize of output 7 [2019-11-20 06:18:27,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:27,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:27,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:27,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-20 06:18:27,607 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 15 treesize of output 7 [2019-11-20 06:18:27,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:27,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:27,609 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 06:18:27,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 06:18:27,617 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 06:18:27,618 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:27,707 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 28 treesize of output 24 [2019-11-20 06:18:27,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 06:18:27,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:27,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 06:18:27,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-20 06:18:27,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 06:18:27,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1175092075] [2019-11-20 06:18:27,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:27,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-20 06:18:27,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410720745] [2019-11-20 06:18:27,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:18:27,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:18:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:18:27,723 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 8 states. [2019-11-20 06:18:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:28,032 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-11-20 06:18:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:18:28,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-20 06:18:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:28,035 INFO L225 Difference]: With dead ends: 107 [2019-11-20 06:18:28,035 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 06:18:28,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:18:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 06:18:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-20 06:18:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 06:18:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2019-11-20 06:18:28,040 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2019-11-20 06:18:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:28,050 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2019-11-20 06:18:28,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:18:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2019-11-20 06:18:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 06:18:28,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:28,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:28,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:28,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1524799172, now seen corresponding path program 1 times [2019-11-20 06:18:28,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:28,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1130676000] [2019-11-20 06:18:28,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:28,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 06:18:28,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:28,580 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 11 treesize of output 7 [2019-11-20 06:18:28,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:28,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:28,589 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 06:18:28,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-20 06:18:28,625 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 15 treesize of output 7 [2019-11-20 06:18:28,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:28,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:28,631 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 06:18:28,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 06:18:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:28,649 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:28,816 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 28 treesize of output 24 [2019-11-20 06:18:28,817 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 06:18:28,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:28,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:28,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-20 06:18:28,904 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 06:18:28,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130676000] [2019-11-20 06:18:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-11-20 06:18:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253392525] [2019-11-20 06:18:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 06:18:28,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 06:18:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:18:28,905 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 12 states. [2019-11-20 06:18:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:29,478 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2019-11-20 06:18:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 06:18:29,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-20 06:18:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:29,479 INFO L225 Difference]: With dead ends: 106 [2019-11-20 06:18:29,479 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 06:18:29,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:18:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 06:18:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2019-11-20 06:18:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 06:18:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2019-11-20 06:18:29,483 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 28 [2019-11-20 06:18:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:29,483 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2019-11-20 06:18:29,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 06:18:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2019-11-20 06:18:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 06:18:29,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:29,485 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:29,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:29,685 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 721461105, now seen corresponding path program 1 times [2019-11-20 06:18:29,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:29,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [243801341] [2019-11-20 06:18:29,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:29,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 06:18:29,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:29,992 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 06:18:29,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:29,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:29,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:29,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 06:18:30,017 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 11 treesize of output 7 [2019-11-20 06:18:30,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,026 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 06:18:30,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 06:18:30,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,091 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 18 treesize of output 46 [2019-11-20 06:18:30,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,110 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-20 06:18:30,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-20 06:18:30,163 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 06:18:30,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 22 [2019-11-20 06:18:30,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:30,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-20 06:18:30,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2019-11-20 06:18:30,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:30,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-11-20 06:18:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:30,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:30,493 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 32 treesize of output 28 [2019-11-20 06:18:30,494 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 06:18:30,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:30,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 06:18:30,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:30,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,625 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 17 treesize of output 21 [2019-11-20 06:18:30,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:30,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,634 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 17 treesize of output 21 [2019-11-20 06:18:30,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:30,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 06:18:30,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-11-20 06:18:30,653 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 10 treesize of output 8 [2019-11-20 06:18:30,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,656 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 10 treesize of output 8 [2019-11-20 06:18:30,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:30,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:30,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 06:18:30,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 06:18:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:30,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [243801341] [2019-11-20 06:18:30,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:18:30,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-20 06:18:30,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679070454] [2019-11-20 06:18:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 06:18:30,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 06:18:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-20 06:18:30,673 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 17 states. [2019-11-20 06:18:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:31,867 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-11-20 06:18:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 06:18:31,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-20 06:18:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:31,869 INFO L225 Difference]: With dead ends: 109 [2019-11-20 06:18:31,869 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 06:18:31,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-11-20 06:18:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 06:18:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2019-11-20 06:18:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 06:18:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-11-20 06:18:31,873 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 29 [2019-11-20 06:18:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-11-20 06:18:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 06:18:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-11-20 06:18:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 06:18:31,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:31,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:32,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:32,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 721461106, now seen corresponding path program 1 times [2019-11-20 06:18:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:32,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [668227758] [2019-11-20 06:18:32,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:32,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 06:18:32,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:32,342 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 06:18:32,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,357 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 06:18:32,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-11-20 06:18:32,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:32,398 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 06:18:32,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,438 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 06:18:32,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,458 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 06:18:32,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-20 06:18:32,534 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 11 treesize of output 7 [2019-11-20 06:18:32,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 06:18:32,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:32,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:45 [2019-11-20 06:18:32,698 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_158|], 3=[|v_#length_100|]} [2019-11-20 06:18:32,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,708 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 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-20 06:18:32,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-20 06:18:32,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,788 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-20 06:18:32,789 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 06:18:32,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2019-11-20 06:18:32,896 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 06:18:32,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 24 [2019-11-20 06:18:32,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,933 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 06:18:32,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 06:18:32,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:32,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:32,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:32,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-11-20 06:18:33,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:33,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-11-20 06:18:33,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:33,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:33,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:33,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-20 06:18:33,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:33,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:33,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:33,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:22 [2019-11-20 06:18:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:33,087 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:34,357 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 38 treesize of output 34 [2019-11-20 06:18:34,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:34,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:34,435 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 72 treesize of output 68 [2019-11-20 06:18:34,436 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 06:18:34,554 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 06:18:34,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:34,565 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 108 treesize of output 100 [2019-11-20 06:18:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,569 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:34,818 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-20 06:18:34,818 INFO L567 ElimStorePlain]: treesize reduction 56, result has 64.6 percent of original size [2019-11-20 06:18:34,836 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 46 treesize of output 38 [2019-11-20 06:18:34,838 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:34,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-20 06:18:34,938 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:104, output treesize:85 [2019-11-20 06:18:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,218 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-20 06:18:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:35,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,464 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 18 treesize of output 22 [2019-11-20 06:18:35,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,503 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 26 treesize of output 30 [2019-11-20 06:18:35,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,523 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 26 treesize of output 30 [2019-11-20 06:18:35,523 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,552 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 20 treesize of output 24 [2019-11-20 06:18:35,552 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,597 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 31 treesize of output 35 [2019-11-20 06:18:35,598 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:35,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-20 06:18:35,618 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:35,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:35,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-20 06:18:35,699 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:155, output treesize:69 [2019-11-20 06:18:36,081 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-11-20 06:18:36,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 06:18:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:36,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:36,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:36,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:37,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:37,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:37,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:37,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668227758] [2019-11-20 06:18:37,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:18:37,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-20 06:18:37,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034378684] [2019-11-20 06:18:37,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 06:18:37,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 06:18:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-20 06:18:37,341 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 21 states. [2019-11-20 06:18:38,441 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-11-20 06:18:38,962 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-11-20 06:18:40,030 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-11-20 06:18:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:41,290 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-11-20 06:18:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 06:18:41,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-20 06:18:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:41,293 INFO L225 Difference]: With dead ends: 111 [2019-11-20 06:18:41,293 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 06:18:41,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-11-20 06:18:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 06:18:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2019-11-20 06:18:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 06:18:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-11-20 06:18:41,297 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 29 [2019-11-20 06:18:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:41,297 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-11-20 06:18:41,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 06:18:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-11-20 06:18:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 06:18:41,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:41,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:41,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:41,503 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -24133987, now seen corresponding path program 1 times [2019-11-20 06:18:41,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:41,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1750920433] [2019-11-20 06:18:41,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:41,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 06:18:41,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:41,723 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 06:18:41,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:41,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:41,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:41,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 06:18:41,750 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 11 treesize of output 7 [2019-11-20 06:18:41,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:41,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:41,758 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 06:18:41,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 06:18:41,793 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 17 treesize of output 9 [2019-11-20 06:18:41,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:41,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:41,795 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 06:18:41,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-20 06:18:41,805 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 06:18:41,805 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:41,900 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 32 treesize of output 28 [2019-11-20 06:18:41,901 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 06:18:41,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:41,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:18:41,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 06:18:42,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:18:42,006 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 10 treesize of output 8 [2019-11-20 06:18:42,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,009 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 10 treesize of output 8 [2019-11-20 06:18:42,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 06:18:42,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 06:18:42,018 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 06:18:42,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750920433] [2019-11-20 06:18:42,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:42,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-20 06:18:42,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427348568] [2019-11-20 06:18:42,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:18:42,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:18:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:18:42,019 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 10 states. [2019-11-20 06:18:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:42,383 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-20 06:18:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:18:42,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-20 06:18:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:42,385 INFO L225 Difference]: With dead ends: 105 [2019-11-20 06:18:42,385 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 06:18:42,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:18:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 06:18:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-20 06:18:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 06:18:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-11-20 06:18:42,388 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 29 [2019-11-20 06:18:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:42,389 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-11-20 06:18:42,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:18:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-11-20 06:18:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 06:18:42,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:42,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:42,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:42,594 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -748153505, now seen corresponding path program 1 times [2019-11-20 06:18:42,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:42,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978802338] [2019-11-20 06:18:42,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:42,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 06:18:42,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:42,817 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 06:18:42,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 06:18:42,847 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 06:18:42,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-11-20 06:18:42,866 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 11 treesize of output 7 [2019-11-20 06:18:42,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,873 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 06:18:42,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-20 06:18:42,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,902 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 15 treesize of output 19 [2019-11-20 06:18:42,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-20 06:18:42,932 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 16 treesize of output 8 [2019-11-20 06:18:42,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:42,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-20 06:18:42,962 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 06:18:42,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:42,982 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 06:18:42,983 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 06:18:42,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 06:18:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:18:43,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:43,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:43,261 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 23 treesize of output 21 [2019-11-20 06:18:43,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,265 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 28 treesize of output 24 [2019-11-20 06:18:43,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:43,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-20 06:18:43,275 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:43,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,277 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:6 [2019-11-20 06:18:43,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:43,341 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 31 treesize of output 29 [2019-11-20 06:18:43,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:43,363 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 06:18:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:18:43,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:43,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:18:43,398 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 31 treesize of output 27 [2019-11-20 06:18:43,398 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,449 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-20 06:18:43,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 06:18:43,450 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-11-20 06:18:43,516 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 19 treesize of output 17 [2019-11-20 06:18:43,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,522 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 18 treesize of output 16 [2019-11-20 06:18:43,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,527 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 18 treesize of output 16 [2019-11-20 06:18:43,528 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:18:43,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:18:43,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-20 06:18:43,554 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2019-11-20 06:18:43,595 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 06:18:43,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978802338] [2019-11-20 06:18:43,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:43,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 06:18:43,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262396534] [2019-11-20 06:18:43,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 06:18:43,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 06:18:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:18:43,597 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 14 states. [2019-11-20 06:18:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:48,177 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-11-20 06:18:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 06:18:48,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-11-20 06:18:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:48,179 INFO L225 Difference]: With dead ends: 120 [2019-11-20 06:18:48,179 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 06:18:48,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-20 06:18:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 06:18:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2019-11-20 06:18:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 06:18:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-20 06:18:48,183 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 30 [2019-11-20 06:18:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:48,183 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-20 06:18:48,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 06:18:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-20 06:18:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 06:18:48,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:48,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:48,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:48,385 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash -748153504, now seen corresponding path program 1 times [2019-11-20 06:18:48,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:48,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1510423445] [2019-11-20 06:18:48,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:18:48,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:18:48,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:18:48,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 06:18:48,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:18:48,575 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 06:18:48,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1510423445] [2019-11-20 06:18:48,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:18:48,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 06:18:48,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868551646] [2019-11-20 06:18:48,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:18:48,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:18:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:18:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:18:48,577 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 3 states. [2019-11-20 06:18:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:18:48,662 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-11-20 06:18:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:18:48,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 06:18:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:18:48,663 INFO L225 Difference]: With dead ends: 92 [2019-11-20 06:18:48,663 INFO L226 Difference]: Without dead ends: 92 [2019-11-20 06:18:48,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 06:18:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-20 06:18:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-11-20 06:18:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 06:18:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-20 06:18:48,666 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2019-11-20 06:18:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:18:48,666 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-20 06:18:48,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:18:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-20 06:18:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 06:18:48,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:18:48,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:18:48,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:48,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 06:18:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:18:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 211809353, now seen corresponding path program 1 times [2019-11-20 06:18:48,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:18:48,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [197940535] [2019-11-20 06:18:48,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a19135de-a8f2-42ff-b8da-989f23dfd6f3/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 06:18:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:18:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:18:49,346 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 06:18:49,346 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 06:18:49,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:18:49,564 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-20 06:18:49,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:18:49 BoogieIcfgContainer [2019-11-20 06:18:49,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:18:49,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:18:49,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:18:49,582 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:18:49,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:18:14" (3/4) ... [2019-11-20 06:18:49,589 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 06:18:49,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:18:49,590 INFO L168 Benchmark]: Toolchain (without parser) took 36511.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 939.3 MB in the beginning and 912.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 376.3 MB. Max. memory is 11.5 GB. [2019-11-20 06:18:49,591 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:18:49,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:18:49,591 INFO L168 Benchmark]: Boogie Preprocessor took 59.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:18:49,591 INFO L168 Benchmark]: RCFGBuilder took 739.02 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-20 06:18:49,592 INFO L168 Benchmark]: TraceAbstraction took 35136.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 912.2 MB in the end (delta: 145.6 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2019-11-20 06:18:49,592 INFO L168 Benchmark]: Witness Printer took 7.25 ms. Allocated memory is still 1.4 GB. Free memory is still 912.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:18:49,593 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 565.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 739.02 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35136.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 912.2 MB in the end (delta: 145.6 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.25 ms. Allocated memory is still 1.4 GB. Free memory is still 912.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; VAL [\old(c)=0, c=0] [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [\old(c)=0, c=0, length=0, list={1766850560:0}] [L533] CALL append(&list) VAL [\old(c)=0, c=0, plist={1766850560:0}] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L522] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L522] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L523] EXPR item->next VAL [\old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2141192192:0}, \old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-693671939:0}, malloc(sizeof *item)={-2141192192:0}, plist={1766850560:0}, plist={1766850560:0}] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2141192192:0}, \old(c)=0, c=1, item={-693671939:0}, item->next={0:0}, malloc(sizeof *item)={-2141192192:0}, malloc(sizeof *item)={-693671939:0}, plist={1766850560:0}, plist={1766850560:0}] [L526] *plist = item VAL [\old(c)=0, c=1, item={-693671939:0}, malloc(sizeof *item)={-693671939:0}, malloc(sizeof *item)={-2141192192:0}, plist={1766850560:0}, plist={1766850560:0}] [L533] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={1766850560:0}] [L534] length++ VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L537] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={1766850560:0}] [L540] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}] [L540] EXPR list->next VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, list->next={0:0}] [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={-693671939:0}, c=1, length=1, list={1766850560:0}, next={0:0}] [L541] free(list) [L542] list = next VAL [\old(c)=0, c=1, length=1, list={1766850560:0}, next={0:0}] [L543] length-- VAL [\old(c)=0, c=1, length=0, list={1766850560:0}, next={0:0}] [L545] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={1766850560:0}, next={0:0}] [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 113 locations, 44 error locations. Result: UNSAFE, OverallTime: 35.0s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 831 SDtfs, 1303 SDslu, 3385 SDs, 0 SdLazy, 3438 SolverSat, 183 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 501 SyntacticMatches, 17 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 188 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 624 ConstructedInterpolants, 58 QuantifiedInterpolants, 166894 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1670 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...