./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 91478db75b245dd627777f414c41af02c9caac2f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 04:40:14,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:40:14,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:40:14,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:40:14,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:40:14,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:40:14,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:40:14,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:40:14,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:40:14,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:40:14,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:40:14,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:40:14,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:40:14,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:40:14,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:40:14,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:40:14,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:40:14,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:40:14,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:40:14,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:40:14,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:40:14,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:40:14,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:40:14,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:40:14,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:40:14,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:40:14,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:40:14,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:40:14,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:40:14,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:40:14,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:40:14,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:40:14,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:40:14,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:40:14,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:40:14,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:40:14,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:40:14,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:40:14,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:40:14,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:40:14,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:40:14,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 04:40:14,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:40:14,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:40:14,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:40:14,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:40:14,937 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:40:14,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:40:14,937 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:40:14,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 04:40:14,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:40:14,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:40:14,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:40:14,939 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 04:40:14,939 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 04:40:14,939 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 04:40:14,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:40:14,940 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:40:14,940 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:40:14,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:40:14,940 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:40:14,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:40:14,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:40:14,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:40:14,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:40:14,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:40:14,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:40:14,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:40:14,942 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:40:14,942 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:40:14,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:40:14,943 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_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 -> 91478db75b245dd627777f414c41af02c9caac2f [2019-11-20 04:40:15,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:40:15,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:40:15,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:40:15,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:40:15,112 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:40:15,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2019-11-20 04:40:15,172 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/data/b591cbd95/49868766447a4adbae40d083171e1831/FLAG82240d28e [2019-11-20 04:40:15,689 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:40:15,690 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2019-11-20 04:40:15,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/data/b591cbd95/49868766447a4adbae40d083171e1831/FLAG82240d28e [2019-11-20 04:40:16,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/data/b591cbd95/49868766447a4adbae40d083171e1831 [2019-11-20 04:40:16,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:40:16,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 04:40:16,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:40:16,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:40:16,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:40:16,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da4b46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16, skipping insertion in model container [2019-11-20 04:40:16,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,151 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:40:16,201 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:40:16,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:40:16,706 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:40:16,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:40:16,849 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:40:16,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16 WrapperNode [2019-11-20 04:40:16,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:40:16,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:40:16,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:40:16,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:40:16,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... [2019-11-20 04:40:16,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:40:16,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:40:16,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:40:16,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:40:16,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 04:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 04:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-20 04:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-20 04:40:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-20 04:40:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-20 04:40:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure free_unsafe_13 [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-20 04:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 04:40:17,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-20 04:40:17,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 04:40:17,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-20 04:40:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 04:40:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 04:40:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 04:40:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 04:40:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 04:40:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 04:40:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 04:40:17,011 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 04:40:17,012 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 04:40:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 04:40:17,014 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 04:40:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 04:40:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 04:40:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 04:40:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 04:40:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 04:40:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 04:40:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-20 04:40:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-20 04:40:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-20 04:40:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-20 04:40:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-20 04:40:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-20 04:40:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 04:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-20 04:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-20 04:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure free_unsafe_13 [2019-11-20 04:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 04:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 04:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-20 04:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-20 04:40:17,561 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:40:18,010 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:40:18,366 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:40:18,371 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 04:40:18,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:40:18 BoogieIcfgContainer [2019-11-20 04:40:18,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:40:18,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:40:18,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:40:18,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:40:18,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:40:16" (1/3) ... [2019-11-20 04:40:18,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc1251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:40:18, skipping insertion in model container [2019-11-20 04:40:18,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:16" (2/3) ... [2019-11-20 04:40:18,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc1251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:40:18, skipping insertion in model container [2019-11-20 04:40:18,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:40:18" (3/3) ... [2019-11-20 04:40:18,380 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13_2.i [2019-11-20 04:40:18,389 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:40:18,397 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-11-20 04:40:18,409 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-11-20 04:40:18,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:40:18,428 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 04:40:18,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:40:18,428 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:40:18,428 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:40:18,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:40:18,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:40:18,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:40:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-20 04:40:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 04:40:18,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:40:18,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:40:18,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:40:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:40:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1991725056, now seen corresponding path program 1 times [2019-11-20 04:40:18,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:40:18,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1422767658] [2019-11-20 04:40:18,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:40:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:40:18,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 04:40:18,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:40:18,953 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:40:18,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:40:18,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:19,014 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-20 04:40:19,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:19,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:40:19,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:30 [2019-11-20 04:40:19,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:19,069 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 7 treesize of output 3 [2019-11-20 04:40:19,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:19,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:19,073 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 04:40:19,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-11-20 04:40:19,090 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 7 treesize of output 5 [2019-11-20 04:40:19,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:19,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:19,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:40:19,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 04:40:19,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:19,170 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 19 treesize of output 41 [2019-11-20 04:40:19,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:19,242 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 04:40:19,243 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 04:40:19,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-20 04:40:19,357 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 04:40:19,360 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:40:19,735 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 04:40:19,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1422767658] [2019-11-20 04:40:19,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:40:19,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 04:40:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998348239] [2019-11-20 04:40:19,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:40:19,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:40:19,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:40:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:40:19,759 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 14 states. [2019-11-20 04:40:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:40:27,698 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-20 04:40:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 04:40:27,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-20 04:40:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:40:27,711 INFO L225 Difference]: With dead ends: 157 [2019-11-20 04:40:27,711 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 04:40:27,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:40:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 04:40:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2019-11-20 04:40:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 04:40:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-20 04:40:27,758 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 17 [2019-11-20 04:40:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:40:27,758 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-20 04:40:27,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:40:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-20 04:40:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 04:40:27,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:40:27,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:40:27,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:40:27,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:40:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:40:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1991725057, now seen corresponding path program 1 times [2019-11-20 04:40:27,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:40:27,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [641876654] [2019-11-20 04:40:27,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:40:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:40:28,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 04:40:28,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:40:28,290 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 04:40:28,291 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 04:40:28,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:28,356 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:40:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:40:28,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,432 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.1 percent of original size [2019-11-20 04:40:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:28,434 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 04:40:28,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:43 [2019-11-20 04:40:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:28,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:28,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-20 04:40:28,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,502 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 37 treesize of output 33 [2019-11-20 04:40:28,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,507 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 04:40:28,508 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:28,559 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 2 xjuncts. [2019-11-20 04:40:28,559 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:120, output treesize:66 [2019-11-20 04:40:28,695 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_2, |v_#length_BEFORE_CALL_4|], 1=[v_prenex_1, |v_#valid_BEFORE_CALL_10|]} [2019-11-20 04:40:28,705 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 29 treesize of output 27 [2019-11-20 04:40:28,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:28,760 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 27 treesize of output 25 [2019-11-20 04:40:28,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:28,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:28,794 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 04:40:28,795 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,829 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-20 04:40:28,830 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_BEFORE_CALL_10| vanished before elimination [2019-11-20 04:40:28,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:40:28,830 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-11-20 04:40:30,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:40:30,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:40:30,905 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 32 treesize of output 34 [2019-11-20 04:40:30,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:30,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:40:30,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:30,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 61 [2019-11-20 04:40:30,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:31,057 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-11-20 04:40:31,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:31,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-20 04:40:31,069 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:31,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:40:31,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-11-20 04:40:31,116 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:40:31,143 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-20 04:40:31,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:40:31,144 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:9 [2019-11-20 04:40:31,213 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 04:40:31,214 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:40:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:31,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:40:32,458 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-20 04:40:32,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 39 [2019-11-20 04:40:33,044 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 04:40:33,574 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 04:40:33,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [641876654] [2019-11-20 04:40:33,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:40:33,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 04:40:33,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398542906] [2019-11-20 04:40:33,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:40:33,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:40:33,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:40:33,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2019-11-20 04:40:33,580 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 16 states. [2019-11-20 04:40:56,470 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 04:41:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:41:52,167 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-20 04:41:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 04:41:52,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-20 04:41:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:41:52,170 INFO L225 Difference]: With dead ends: 142 [2019-11-20 04:41:52,170 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 04:41:52,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=177, Invalid=417, Unknown=6, NotChecked=0, Total=600 [2019-11-20 04:41:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 04:41:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2019-11-20 04:41:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 04:41:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-20 04:41:52,192 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 17 [2019-11-20 04:41:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:41:52,193 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-20 04:41:52,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:41:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-20 04:41:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:41:52,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:41:52,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:41:52,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:41:52,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:41:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:41:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 508317535, now seen corresponding path program 1 times [2019-11-20 04:41:52,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:41:52,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1211485618] [2019-11-20 04:41:52,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:41:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:41:52,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 04:41:52,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:41:52,704 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 04:41:52,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:52,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:52,717 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 04:41:52,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-11-20 04:41:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:41:52,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:41:52,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:52,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-20 04:41:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:41:52,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:52,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:52,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:41:52,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 04:41:52,892 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 04:41:52,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1211485618] [2019-11-20 04:41:52,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:41:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-20 04:41:52,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330689178] [2019-11-20 04:41:52,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 04:41:52,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:41:52,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 04:41:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:41:52,893 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 11 states. [2019-11-20 04:41:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:41:53,637 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2019-11-20 04:41:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:41:53,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-20 04:41:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:41:53,640 INFO L225 Difference]: With dead ends: 141 [2019-11-20 04:41:53,640 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 04:41:53,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-20 04:41:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 04:41:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2019-11-20 04:41:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 04:41:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-20 04:41:53,650 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 20 [2019-11-20 04:41:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:41:53,651 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-20 04:41:53,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 04:41:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-20 04:41:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:41:53,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:41:53,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:41:53,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:41:53,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:41:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:41:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 508317536, now seen corresponding path program 1 times [2019-11-20 04:41:53,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:41:53,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [766868261] [2019-11-20 04:41:53,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:41:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:41:54,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-20 04:41:54,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:41:54,171 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 04:41:54,171 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 04:41:54,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,258 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:41:54,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:41:54,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,311 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.3 percent of original size [2019-11-20 04:41:54,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,312 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 04:41:54,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:50 [2019-11-20 04:41:54,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:54,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2019-11-20 04:41:54,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:41:54,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 65 [2019-11-20 04:41:54,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,490 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 48 treesize of output 52 [2019-11-20 04:41:54,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,602 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-20 04:41:54,606 INFO L567 ElimStorePlain]: treesize reduction 43, result has 62.3 percent of original size [2019-11-20 04:41:54,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,615 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 36 treesize of output 40 [2019-11-20 04:41:54,615 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,618 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 04:41:54,618 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:54,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:54,628 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 04:41:54,628 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:157, output treesize:24 [2019-11-20 04:41:56,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:56,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:56,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2019-11-20 04:41:56,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:56,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:41:56,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:41:56,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:56,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2019-11-20 04:41:56,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:56,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:56,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 100 [2019-11-20 04:41:56,786 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:56,912 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-20 04:41:56,913 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.6 percent of original size [2019-11-20 04:41:56,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:56,935 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 42 treesize of output 55 [2019-11-20 04:41:56,936 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:56,954 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:56,954 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 44 treesize of output 57 [2019-11-20 04:41:56,955 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:57,059 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-20 04:41:57,060 INFO L567 ElimStorePlain]: treesize reduction 10, result has 89.5 percent of original size [2019-11-20 04:41:57,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 04:41:57,061 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:170, output treesize:59 [2019-11-20 04:41:57,167 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 04:41:57,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:57,186 INFO L567 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2019-11-20 04:41:57,188 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 04:41:57,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:41:57,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:41:57,196 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 04:41:57,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2019-11-20 04:41:57,258 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 04:41:57,258 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:41:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:58,678 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 04:41:58,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:41:58,701 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 04:42:01,756 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-20 04:42:01,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-20 04:42:04,383 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-20 04:42:08,188 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 04:42:08,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766868261] [2019-11-20 04:42:08,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:08,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 20 [2019-11-20 04:42:08,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440084135] [2019-11-20 04:42:08,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 04:42:08,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:42:08,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 04:42:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=359, Unknown=1, NotChecked=0, Total=420 [2019-11-20 04:42:08,191 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 21 states. [2019-11-20 04:42:33,057 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 04:42:34,991 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 04:42:51,636 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-20 04:42:56,272 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-11-20 04:43:22,074 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:43:51,986 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-20 04:43:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:59,332 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-11-20 04:43:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 04:43:59,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-11-20 04:43:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:59,336 INFO L225 Difference]: With dead ends: 141 [2019-11-20 04:43:59,337 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 04:43:59,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=272, Invalid=987, Unknown=1, NotChecked=0, Total=1260 [2019-11-20 04:43:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 04:43:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2019-11-20 04:43:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 04:43:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-11-20 04:43:59,347 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 20 [2019-11-20 04:43:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:59,348 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-11-20 04:43:59,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 04:43:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-11-20 04:43:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:43:59,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:59,349 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] [2019-11-20 04:43:59,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:43:59,552 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:43:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1422025552, now seen corresponding path program 1 times [2019-11-20 04:43:59,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:43:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1976456291] [2019-11-20 04:43:59,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:43:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:59,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 04:43:59,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:43:59,777 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 04:43:59,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:43:59,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:43:59,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:43:59,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:43:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:43:59,839 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:43:59,957 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 04:43:59,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1976456291] [2019-11-20 04:43:59,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:59,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-20 04:43:59,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067157778] [2019-11-20 04:43:59,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:43:59,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:43:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:43:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:43:59,958 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 14 states. [2019-11-20 04:44:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:00,630 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-11-20 04:44:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:44:00,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 04:44:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:00,632 INFO L225 Difference]: With dead ends: 112 [2019-11-20 04:44:00,633 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 04:44:00,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:44:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 04:44:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-11-20 04:44:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 04:44:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 04:44:00,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 21 [2019-11-20 04:44:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:00,643 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 04:44:00,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:44:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 04:44:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:44:00,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:00,644 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] [2019-11-20 04:44:00,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:00,845 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1422025551, now seen corresponding path program 1 times [2019-11-20 04:44:00,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:00,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2063511201] [2019-11-20 04:44:00,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:01,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 04:44:01,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:01,107 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 04:44:01,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:01,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:01,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:01,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:44:01,203 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 04:44:01,203 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:01,856 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 04:44:01,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063511201] [2019-11-20 04:44:01,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:01,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-20 04:44:01,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064716982] [2019-11-20 04:44:01,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 04:44:01,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:01,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 04:44:01,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-20 04:44:01,858 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 18 states. [2019-11-20 04:44:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:03,437 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-11-20 04:44:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:44:03,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-20 04:44:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:03,439 INFO L225 Difference]: With dead ends: 110 [2019-11-20 04:44:03,440 INFO L226 Difference]: Without dead ends: 110 [2019-11-20 04:44:03,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:44:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-20 04:44:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-20 04:44:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 04:44:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2019-11-20 04:44:03,445 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 21 [2019-11-20 04:44:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:03,446 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2019-11-20 04:44:03,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 04:44:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2019-11-20 04:44:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:44:03,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:03,447 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] [2019-11-20 04:44:03,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:03,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1292942833, now seen corresponding path program 1 times [2019-11-20 04:44:03,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:03,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1472041341] [2019-11-20 04:44:03,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:03,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:44:03,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:03,907 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 04:44:03,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:03,939 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 04:44:03,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1472041341] [2019-11-20 04:44:03,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:03,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 04:44:03,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468580744] [2019-11-20 04:44:03,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:44:03,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:44:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:44:03,940 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 5 states. [2019-11-20 04:44:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:03,960 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-11-20 04:44:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:44:03,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 04:44:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:03,963 INFO L225 Difference]: With dead ends: 93 [2019-11-20 04:44:03,963 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 04:44:03,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:44:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 04:44:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-20 04:44:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 04:44:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2019-11-20 04:44:03,968 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 21 [2019-11-20 04:44:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:03,969 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2019-11-20 04:44:03,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:44:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2019-11-20 04:44:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:44:03,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:03,970 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] [2019-11-20 04:44:04,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:04,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 438622591, now seen corresponding path program 1 times [2019-11-20 04:44:04,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:04,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1421372665] [2019-11-20 04:44:04,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:04,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:44:04,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:04,375 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 04:44:04,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:04,457 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 04:44:04,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421372665] [2019-11-20 04:44:04,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:04,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 04:44:04,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814941319] [2019-11-20 04:44:04,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:44:04,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:44:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:44:04,458 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 5 states. [2019-11-20 04:44:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:04,471 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-11-20 04:44:04,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:44:04,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 04:44:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:04,473 INFO L225 Difference]: With dead ends: 91 [2019-11-20 04:44:04,473 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 04:44:04,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:44:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 04:44:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-20 04:44:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 04:44:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-11-20 04:44:04,480 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 21 [2019-11-20 04:44:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:04,480 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-11-20 04:44:04,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:44:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-11-20 04:44:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:44:04,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:04,482 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] [2019-11-20 04:44:04,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:04,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 567705310, now seen corresponding path program 1 times [2019-11-20 04:44:04,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [324224774] [2019-11-20 04:44:04,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:04,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 04:44:04,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:04,929 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:44:04,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:44:04,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:04,955 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-20 04:44:04,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:04,957 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 04:44:04,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-20 04:44:04,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:04,981 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 7 treesize of output 5 [2019-11-20 04:44:04,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:04,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:04,996 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 7 treesize of output 3 [2019-11-20 04:44:04,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:05,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2019-11-20 04:44:05,035 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 04:44:05,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,046 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 04:44:05,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-20 04:44:05,072 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 04:44:05,073 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:05,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:05,290 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 42 treesize of output 36 [2019-11-20 04:44:05,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,295 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 04:44:05,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,303 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 37 treesize of output 31 [2019-11-20 04:44:05,304 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,306 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 04:44:05,307 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:05,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:05,337 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_2| vanished before elimination [2019-11-20 04:44:05,338 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 04:44:05,338 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:60 [2019-11-20 04:44:05,457 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 04:44:05,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [324224774] [2019-11-20 04:44:05,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:05,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 04:44:05,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838223753] [2019-11-20 04:44:05,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:44:05,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:05,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:44:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:44:05,461 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 10 states. [2019-11-20 04:44:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:06,299 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-11-20 04:44:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 04:44:06,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-20 04:44:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:06,301 INFO L225 Difference]: With dead ends: 128 [2019-11-20 04:44:06,301 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 04:44:06,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-11-20 04:44:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 04:44:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2019-11-20 04:44:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 04:44:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-20 04:44:06,307 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 21 [2019-11-20 04:44:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-20 04:44:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:44:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-20 04:44:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:44:06,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:06,308 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] [2019-11-20 04:44:06,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:06,511 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 567705311, now seen corresponding path program 1 times [2019-11-20 04:44:06,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:06,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1304631728] [2019-11-20 04:44:06,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:06,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-20 04:44:06,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:06,727 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 04:44:06,727 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 04:44:06,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,738 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 04:44:06,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2019-11-20 04:44:06,762 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 04:44:06,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,778 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 7 treesize of output 3 [2019-11-20 04:44:06,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,790 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 7 treesize of output 3 [2019-11-20 04:44:06,791 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,798 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2019-11-20 04:44:06,823 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 04:44:06,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,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 15 treesize of output 7 [2019-11-20 04:44:06,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:06,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:06,843 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 04:44:06,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-11-20 04:44:06,866 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 04:44:06,867 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:07,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:44:07,178 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 10 [2019-11-20 04:44:07,178 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 04:44:07,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:07,252 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2019-11-20 04:44:07,261 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 33 treesize of output 17 [2019-11-20 04:44:07,261 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 04:44:07,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:07,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:07,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:54 [2019-11-20 04:44:07,583 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 04:44:07,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1304631728] [2019-11-20 04:44:07,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:07,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 04:44:07,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002294876] [2019-11-20 04:44:07,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 04:44:07,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 04:44:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:44:07,586 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 12 states. [2019-11-20 04:44:08,964 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 04:44:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:10,335 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-20 04:44:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 04:44:10,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-20 04:44:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:10,337 INFO L225 Difference]: With dead ends: 164 [2019-11-20 04:44:10,337 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 04:44:10,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:44:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 04:44:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 118. [2019-11-20 04:44:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 04:44:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-11-20 04:44:10,348 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 21 [2019-11-20 04:44:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:10,348 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-11-20 04:44:10,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 04:44:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-11-20 04:44:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 04:44:10,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:10,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:10,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:10,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash -766953741, now seen corresponding path program 1 times [2019-11-20 04:44:10,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:10,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [632615627] [2019-11-20 04:44:10,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:10,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:44:10,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:10,791 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 7 treesize of output 3 [2019-11-20 04:44:10,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:10,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:10,792 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 04:44:10,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:7, output treesize:1 [2019-11-20 04:44:10,822 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 04:44:10,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:10,848 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 04:44:10,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632615627] [2019-11-20 04:44:10,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:10,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 04:44:10,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529719169] [2019-11-20 04:44:10,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:44:10,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:44:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:44:10,849 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 6 states. [2019-11-20 04:44:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:11,463 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2019-11-20 04:44:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:44:11,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-20 04:44:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:11,465 INFO L225 Difference]: With dead ends: 141 [2019-11-20 04:44:11,465 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 04:44:11,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:44:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 04:44:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2019-11-20 04:44:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 04:44:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2019-11-20 04:44:11,469 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 23 [2019-11-20 04:44:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:11,470 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2019-11-20 04:44:11,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:44:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2019-11-20 04:44:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 04:44:11,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:11,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:11,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:11,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash -766953740, now seen corresponding path program 1 times [2019-11-20 04:44:11,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:11,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1093053435] [2019-11-20 04:44:11,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:11,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 04:44:11,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:11,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:44:11,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:11,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:11,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:44:11,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:11,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:11,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:11,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-20 04:44:12,053 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 04:44:12,053 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:12,110 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 26 treesize of output 24 [2019-11-20 04:44:12,110 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 04:44:12,128 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 26 [2019-11-20 04:44:12,129 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 04:44:12,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:12,151 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 30 treesize of output 34 [2019-11-20 04:44:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:12,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:12,152 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:44:12,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:12,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 04:44:12,243 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-20 04:44:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:12,471 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-20 04:44:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:12,768 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-20 04:44:13,206 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 04:44:13,745 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 04:44:13,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1093053435] [2019-11-20 04:44:13,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:13,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 04:44:13,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994870784] [2019-11-20 04:44:13,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:44:13,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:44:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:44:13,746 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 16 states. [2019-11-20 04:44:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:15,284 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2019-11-20 04:44:15,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:44:15,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 04:44:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:15,287 INFO L225 Difference]: With dead ends: 140 [2019-11-20 04:44:15,288 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 04:44:15,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-20 04:44:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 04:44:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2019-11-20 04:44:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 04:44:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2019-11-20 04:44:15,293 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 23 [2019-11-20 04:44:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:15,293 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2019-11-20 04:44:15,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:44:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2019-11-20 04:44:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 04:44:15,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:15,294 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] [2019-11-20 04:44:15,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:15,499 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash 410073591, now seen corresponding path program 1 times [2019-11-20 04:44:15,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:15,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [32325827] [2019-11-20 04:44:15,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:15,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:44:15,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:15,745 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:44:15,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:44:15,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,771 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-20 04:44:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:15,772 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 04:44:15,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-20 04:44:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:15,805 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 7 treesize of output 5 [2019-11-20 04:44:15,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:15,819 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 7 treesize of output 3 [2019-11-20 04:44:15,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:15,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2019-11-20 04:44:15,843 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 04:44:15,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,851 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 04:44:15,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:15,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-20 04:44:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:44:15,886 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:15,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:16,003 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 32 treesize of output 30 [2019-11-20 04:44:16,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:16,006 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 04:44:16,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-11-20 04:44:16,010 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:16,012 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 04:44:16,012 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:16,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:16,029 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_6| vanished before elimination [2019-11-20 04:44:16,030 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 04:44:16,030 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:60 [2019-11-20 04:44:16,114 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 04:44:16,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32325827] [2019-11-20 04:44:16,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:16,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-20 04:44:16,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106002499] [2019-11-20 04:44:16,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 04:44:16,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 04:44:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:44:16,116 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 12 states. [2019-11-20 04:44:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:17,253 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-11-20 04:44:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 04:44:17,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-20 04:44:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:17,255 INFO L225 Difference]: With dead ends: 155 [2019-11-20 04:44:17,255 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 04:44:17,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-11-20 04:44:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 04:44:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2019-11-20 04:44:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 04:44:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-11-20 04:44:17,261 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 26 [2019-11-20 04:44:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:17,261 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-11-20 04:44:17,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 04:44:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-11-20 04:44:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 04:44:17,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:17,262 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] [2019-11-20 04:44:17,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:17,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 410073592, now seen corresponding path program 1 times [2019-11-20 04:44:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:17,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [109234598] [2019-11-20 04:44:17,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:17,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 04:44:17,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:17,700 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 7 treesize of output 3 [2019-11-20 04:44:17,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:17,711 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 7 treesize of output 3 [2019-11-20 04:44:17,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:17,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-20 04:44:17,735 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 04:44:17,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:17,746 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 04:44:17,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:17,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:17,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-20 04:44:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:44:17,778 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:17,952 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 04:44:17,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109234598] [2019-11-20 04:44:17,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:17,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 04:44:17,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834922005] [2019-11-20 04:44:17,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 04:44:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 04:44:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:44:17,954 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 11 states. [2019-11-20 04:44:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:18,529 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-11-20 04:44:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 04:44:18,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-20 04:44:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:18,530 INFO L225 Difference]: With dead ends: 114 [2019-11-20 04:44:18,531 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 04:44:18,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:44:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 04:44:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-11-20 04:44:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 04:44:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 04:44:18,535 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 26 [2019-11-20 04:44:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:18,535 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 04:44:18,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 04:44:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 04:44:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 04:44:18,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:18,536 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 04:44:18,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:18,737 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1329326739, now seen corresponding path program 1 times [2019-11-20 04:44:18,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:18,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [373366679] [2019-11-20 04:44:18,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:18,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 04:44:18,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:19,014 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:44:19,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:44:19,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,045 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-20 04:44:19,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:19,045 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 04:44:19,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-20 04:44:19,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:19,065 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 7 treesize of output 5 [2019-11-20 04:44:19,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:19,075 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 7 treesize of output 3 [2019-11-20 04:44:19,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:19,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2019-11-20 04:44:19,097 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 7 treesize of output 3 [2019-11-20 04:44:19,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:19,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 04:44:19,183 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 7 treesize of output 3 [2019-11-20 04:44:19,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:19,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:19,186 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 04:44:19,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-11-20 04:44:19,218 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 04:44:19,218 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:19,392 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 04:44:19,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [373366679] [2019-11-20 04:44:19,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:19,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 6] imperfect sequences [] total 13 [2019-11-20 04:44:19,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521266268] [2019-11-20 04:44:19,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:44:19,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:44:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:44:19,394 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 14 states. [2019-11-20 04:44:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:20,362 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-11-20 04:44:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 04:44:20,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-20 04:44:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:20,363 INFO L225 Difference]: With dead ends: 120 [2019-11-20 04:44:20,364 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 04:44:20,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2019-11-20 04:44:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 04:44:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2019-11-20 04:44:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 04:44:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-11-20 04:44:20,368 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 28 [2019-11-20 04:44:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:20,368 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-11-20 04:44:20,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:44:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-11-20 04:44:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 04:44:20,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:20,369 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 04:44:20,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:20,570 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1329326738, now seen corresponding path program 1 times [2019-11-20 04:44:20,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:20,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [739603572] [2019-11-20 04:44:20,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/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 04:44:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:20,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 04:44:20,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:20,816 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 04:44:20,816 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 04:44:20,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:20,828 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 04:44:20,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-11-20 04:44:20,858 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 04:44:20,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:20,905 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 7 treesize of output 3 [2019-11-20 04:44:20,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:20,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2019-11-20 04:44:20,945 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 7 treesize of output 3 [2019-11-20 04:44:20,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:20,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:20,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-20 04:44:21,020 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 7 treesize of output 3 [2019-11-20 04:44:21,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:21,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:21,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:21,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-20 04:44:21,070 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 04:44:21,070 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:21,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:21,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:21,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:21,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 42 treesize of output 40 [2019-11-20 04:44:21,754 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 04:44:21,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:21,822 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 41 treesize of output 37 [2019-11-20 04:44:21,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:21,877 INFO L567 ElimStorePlain]: treesize reduction 41, result has 45.3 percent of original size [2019-11-20 04:44:21,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:21,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-20 04:44:22,042 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 04:44:22,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [739603572] [2019-11-20 04:44:22,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:22,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-20 04:44:22,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376892343] [2019-11-20 04:44:22,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 04:44:22,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 04:44:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:44:22,044 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 22 states. [2019-11-20 04:44:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:23,946 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-11-20 04:44:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 04:44:23,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-20 04:44:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:23,947 INFO L225 Difference]: With dead ends: 105 [2019-11-20 04:44:23,947 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 04:44:23,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=610, Unknown=0, NotChecked=0, Total=870 [2019-11-20 04:44:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 04:44:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-20 04:44:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 04:44:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-11-20 04:44:23,957 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 28 [2019-11-20 04:44:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:23,957 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-11-20 04:44:23,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 04:44:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-11-20 04:44:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 04:44:23,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:23,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:24,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:24,163 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1414276707, now seen corresponding path program 1 times [2019-11-20 04:44:24,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:24,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [354769879] [2019-11-20 04:44:24,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:24,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 04:44:24,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:24,447 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 7 treesize of output 3 [2019-11-20 04:44:24,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:24,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 04:44:24,455 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 04:44:24,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:24,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:44:24,600 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 04:44:24,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:24,607 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 04:44:24,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-20 04:44:24,697 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 04:44:24,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:24,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:24,701 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 04:44:24,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-20 04:44:24,737 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 04:44:24,737 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:25,333 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 51 treesize of output 47 [2019-11-20 04:44:25,334 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 04:44:25,354 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 50 treesize of output 46 [2019-11-20 04:44:25,354 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 04:44:25,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:25,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 04:44:25,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:94 [2019-11-20 04:44:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:25,532 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-20 04:44:25,613 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 04:44:25,614 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 04:44:25,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:25,645 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 04:44:25,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:42 [2019-11-20 04:44:26,043 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 04:44:26,140 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 04:44:26,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354769879] [2019-11-20 04:44:26,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:26,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 24 [2019-11-20 04:44:26,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532835327] [2019-11-20 04:44:26,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 04:44:26,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:26,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 04:44:26,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-20 04:44:26,142 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 25 states. [2019-11-20 04:44:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:28,013 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-11-20 04:44:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 04:44:28,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-20 04:44:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:28,015 INFO L225 Difference]: With dead ends: 105 [2019-11-20 04:44:28,015 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 04:44:28,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 04:44:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 04:44:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2019-11-20 04:44:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 04:44:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-20 04:44:28,019 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2019-11-20 04:44:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:28,045 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-20 04:44:28,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 04:44:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-20 04:44:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 04:44:28,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:28,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:28,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:28,249 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1414276706, now seen corresponding path program 1 times [2019-11-20 04:44:28,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:28,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [683022731] [2019-11-20 04:44:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:28,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-20 04:44:28,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:28,521 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 7 treesize of output 3 [2019-11-20 04:44:28,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 04:44:28,540 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 04:44:28,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 04:44:28,685 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 04:44:28,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,701 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 04:44:28,701 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,711 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 04:44:28,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-20 04:44:28,873 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 04:44:28,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,886 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 04:44:28,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:28,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:28,896 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 04:44:28,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-11-20 04:44:28,940 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 04:44:28,941 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:30,475 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 62 treesize of output 54 [2019-11-20 04:44:30,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:30,636 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 04:44:30,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:30,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:30,786 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 04:44:30,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:30,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,794 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:30,906 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 04:44:30,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:30,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:30,917 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:31,020 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 04:44:31,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:31,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 04:44:31,021 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-20 04:44:31,251 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 04:44:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:44:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:44:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:44:31,734 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-20 04:44:31,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2019-11-20 04:44:31,754 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 04:44:31,973 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 04:44:31,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:31,996 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 54 treesize of output 50 [2019-11-20 04:44:31,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:32,282 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-11-20 04:44:32,282 INFO L567 ElimStorePlain]: treesize reduction 36, result has 79.5 percent of original size [2019-11-20 04:44:32,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:32,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:32,289 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:32,426 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:44:32,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:32,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:32,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:32,432 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:32,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:32,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 04:44:32,527 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-20 04:44:33,197 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 04:44:33,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [683022731] [2019-11-20 04:44:33,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:33,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 26 [2019-11-20 04:44:33,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470176733] [2019-11-20 04:44:33,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 04:44:33,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:33,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 04:44:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-20 04:44:33,200 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 27 states. [2019-11-20 04:44:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:37,289 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-11-20 04:44:37,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 04:44:37,290 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-20 04:44:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:37,291 INFO L225 Difference]: With dead ends: 91 [2019-11-20 04:44:37,291 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 04:44:37,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 04:44:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 04:44:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2019-11-20 04:44:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 04:44:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-11-20 04:44:37,294 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 35 [2019-11-20 04:44:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:37,294 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-11-20 04:44:37,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 04:44:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-11-20 04:44:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 04:44:37,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:37,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:37,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:37,499 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 180993689, now seen corresponding path program 1 times [2019-11-20 04:44:37,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:37,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [35932858] [2019-11-20 04:44:37,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:37,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-20 04:44:37,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:37,805 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 7 treesize of output 3 [2019-11-20 04:44:37,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:37,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-20 04:44:37,820 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 04:44:37,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:37,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 04:44:37,968 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 04:44:37,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:37,987 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 04:44:37,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:37,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:37,998 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 04:44:37,998 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-20 04:44:38,135 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 04:44:38,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:38,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:38,143 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 04:44:38,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:38,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:38,148 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 04:44:38,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-11-20 04:44:38,260 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 04:44:38,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:39,306 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 04:44:40,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,213 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 87 treesize of output 83 [2019-11-20 04:44:40,214 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 04:44:40,242 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 106 treesize of output 102 [2019-11-20 04:44:40,242 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 04:44:40,833 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-20 04:44:40,833 INFO L567 ElimStorePlain]: treesize reduction 32, result has 92.6 percent of original size [2019-11-20 04:44:40,853 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 150 treesize of output 138 [2019-11-20 04:44:40,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,873 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 04:44:40,902 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 92 treesize of output 84 [2019-11-20 04:44:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,905 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:40,931 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 131 treesize of output 119 [2019-11-20 04:44:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:40,944 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 04:44:40,999 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 51 treesize of output 43 [2019-11-20 04:44:41,002 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:41,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:41,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:41,024 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:41,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:41,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:41,054 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:41,718 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-11-20 04:44:41,718 INFO L567 ElimStorePlain]: treesize reduction 166, result has 59.1 percent of original size [2019-11-20 04:44:41,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-20 04:44:41,719 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:384, output treesize:238 [2019-11-20 04:44:42,286 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-20 04:44:42,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:44:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:44:42,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:42,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:42,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 04:44:43,535 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2019-11-20 04:44:43,575 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 106 treesize of output 102 [2019-11-20 04:44:43,576 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 04:44:44,083 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-20 04:44:44,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:44,113 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 101 treesize of output 93 [2019-11-20 04:44:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,116 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 04:44:44,694 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-20 04:44:44,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:44,732 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 127 treesize of output 119 [2019-11-20 04:44:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:44,735 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 04:44:45,923 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-20 04:44:45,923 INFO L567 ElimStorePlain]: treesize reduction 50, result has 88.5 percent of original size [2019-11-20 04:44:45,957 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 51 treesize of output 43 [2019-11-20 04:44:45,959 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:46,765 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-11-20 04:44:46,765 INFO L567 ElimStorePlain]: treesize reduction 46, result has 87.5 percent of original size [2019-11-20 04:44:46,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 70 treesize of output 62 [2019-11-20 04:44:46,789 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:47,310 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-20 04:44:47,311 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.2 percent of original size [2019-11-20 04:44:47,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,321 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:47,551 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 04:44:47,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:47,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,563 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:47,776 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 04:44:47,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:47,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:47,785 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:47,967 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 04:44:47,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:47,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-20 04:44:47,968 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:352, output treesize:198 [2019-11-20 04:44:48,322 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 04:44:48,800 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 04:44:48,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [35932858] [2019-11-20 04:44:48,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:44:48,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 31 [2019-11-20 04:44:48,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109214968] [2019-11-20 04:44:48,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 04:44:48,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:44:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 04:44:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-20 04:44:48,801 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 32 states. [2019-11-20 04:44:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:54,012 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-11-20 04:44:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 04:44:54,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-20 04:44:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:54,014 INFO L225 Difference]: With dead ends: 89 [2019-11-20 04:44:54,014 INFO L226 Difference]: Without dead ends: 89 [2019-11-20 04:44:54,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 04:44:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-20 04:44:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2019-11-20 04:44:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 04:44:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-11-20 04:44:54,018 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 40 [2019-11-20 04:44:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:54,018 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-11-20 04:44:54,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 04:44:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-11-20 04:44:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 04:44:54,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:44:54,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:44:54,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:54,219 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_unsafe_13Err4REQUIRES_VIOLATION, free_unsafe_13Err2REQUIRES_VIOLATION, free_unsafe_13Err3REQUIRES_VIOLATION, free_unsafe_13Err1REQUIRES_VIOLATION, free_unsafe_13Err5REQUIRES_VIOLATION, free_unsafe_13Err0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-20 04:44:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:44:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash -55407982, now seen corresponding path program 1 times [2019-11-20 04:44:54,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:44:54,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1358889166] [2019-11-20 04:44:54,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa2aa91-0826-4713-a89c-d4cf1cc3fc77/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:44:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:44:54,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-20 04:44:54,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:44:54,633 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 04:44:54,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-20 04:44:54,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,661 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-11-20 04:44:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:54,662 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 04:44:54,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:33 [2019-11-20 04:44:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:44:54,681 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 7 treesize of output 5 [2019-11-20 04:44:54,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:54,692 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 7 treesize of output 3 [2019-11-20 04:44:54,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:54,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,698 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-20 04:44:54,773 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-20 04:44:54,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:54,779 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 04:44:54,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2019-11-20 04:44:54,969 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 04:44:54,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:54,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:54,989 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 04:44:54,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-20 04:44:55,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:55,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-20 04:44:55,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,071 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 04:44:55,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-20 04:44:55,140 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_267|], 6=[|v_#memory_$Pointer$.base_315|]} [2019-11-20 04:44:55,145 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 04:44:55,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:44:55,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 84 [2019-11-20 04:44:55,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,294 INFO L567 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-11-20 04:44:55,295 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 04:44:55,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2019-11-20 04:44:55,589 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-20 04:44:55,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:55,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:55,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,726 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 27 treesize of output 43 [2019-11-20 04:44:55,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,767 INFO L567 ElimStorePlain]: treesize reduction 13, result has 85.4 percent of original size [2019-11-20 04:44:55,771 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 27 treesize of output 19 [2019-11-20 04:44:55,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:65 [2019-11-20 04:44:55,863 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 47 treesize of output 31 [2019-11-20 04:44:55,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:55,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:55,889 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 04:44:55,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:59 [2019-11-20 04:44:56,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:56,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 22 [2019-11-20 04:44:56,196 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 04:44:56,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:44:56,207 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 04:44:56,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:19 [2019-11-20 04:44:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:44:56,383 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:44:56,987 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 04:44:57,227 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:44:57,345 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:44:57,553 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 04:44:57,767 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 04:44:57,897 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 04:44:58,149 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 04:44:58,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:58,436 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-20 04:44:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:58,437 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 04:44:58,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:39 [2019-11-20 04:44:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:58,880 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 04:44:59,071 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:44:59,205 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 04:44:59,387 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 04:44:59,615 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 04:44:59,758 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 04:44:59,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,813 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,832 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,853 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,870 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,885 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,904 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,923 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,945 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,961 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:44:59,983 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 04:44:59,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:45:00,003 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-20 04:45:00,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:45:00,025 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-20 04:45:00,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:45:00,045 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-20 04:45:00,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:45:00,057 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-20 04:45:00,846 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 04:45:00,846 INFO L567 ElimStorePlain]: treesize reduction 371, result has 62.3 percent of original size [2019-11-20 04:45:00,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2019-11-20 04:45:00,846 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:1337, output treesize:614 [2019-11-20 04:45:00,847 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 04:45:01,152 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-20 04:45:01,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:45:01,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:45:01,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:45:01,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:45:01,164 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 76 [2019-11-20 04:45:01,591 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5821 conjuctions. This might take some time... [2019-11-20 04:45:01,617 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 11 conjuctions. [2019-11-20 04:45:01,618 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-20 04:45:01,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:45:01,826 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 04:45:01,829 INFO L168 Benchmark]: Toolchain (without parser) took 285692.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -120.1 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:45:01,829 INFO L168 Benchmark]: CDTParser took 0.19 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 04:45:01,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -227.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:45:01,830 INFO L168 Benchmark]: Boogie Preprocessor took 91.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:45:01,830 INFO L168 Benchmark]: RCFGBuilder took 1430.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:45:01,832 INFO L168 Benchmark]: TraceAbstraction took 283454.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 21.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -12.6 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:45:01,833 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.19 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 712.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -227.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1430.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 283454.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 21.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -12.6 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...