./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/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 2d51915f2a44f0762761fec81bdd888a975b61fb .................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/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 2d51915f2a44f0762761fec81bdd888a975b61fb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:13:40,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:13:40,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:13:41,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:13:41,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:13:41,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:13:41,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:13:41,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:13:41,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:13:41,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:13:41,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:13:41,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:13:41,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:13:41,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:13:41,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:13:41,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:13:41,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:13:41,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:13:41,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:13:41,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:13:41,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:13:41,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:13:41,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:13:41,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:13:41,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:13:41,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:13:41,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:13:41,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:13:41,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:13:41,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:13:41,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:13:41,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:13:41,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:13:41,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:13:41,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:13:41,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:13:41,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:13:41,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:13:41,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:13:41,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:13:41,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:13:41,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-30 00:13:41,151 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:13:41,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:13:41,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:13:41,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:13:41,154 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:13:41,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:13:41,155 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:13:41,155 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:13:41,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:13:41,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:13:41,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:13:41,157 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:13:41,157 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:13:41,158 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 00:13:41,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:13:41,159 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:13:41,159 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:13:41,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:13:41,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:13:41,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:13:41,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:13:41,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:13:41,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:13:41,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:13:41,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:13:41,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:13:41,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:13:41,163 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:13:41,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8ca06ae5-e9c8-4489-836d-5cff52e79faf/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 -> 2d51915f2a44f0762761fec81bdd888a975b61fb [2020-11-30 00:13:41,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:13:41,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:13:41,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:13:41,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:13:41,483 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:13:41,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2020-11-30 00:13:41,578 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/c53e50543/18d5d8603f204ea68a39b507d0d8d7b3/FLAGdfa2c4f57 [2020-11-30 00:13:42,261 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:13:42,262 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2020-11-30 00:13:42,282 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/c53e50543/18d5d8603f204ea68a39b507d0d8d7b3/FLAGdfa2c4f57 [2020-11-30 00:13:42,478 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/c53e50543/18d5d8603f204ea68a39b507d0d8d7b3 [2020-11-30 00:13:42,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:13:42,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:13:42,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:13:42,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:13:42,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:13:42,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:13:42" (1/1) ... [2020-11-30 00:13:42,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d0fbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:42, skipping insertion in model container [2020-11-30 00:13:42,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:13:42" (1/1) ... [2020-11-30 00:13:42,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:13:42,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:13:43,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:13:43,039 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2020-11-30 00:13:43,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ad1d28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:43, skipping insertion in model container [2020-11-30 00:13:43,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:13:43,041 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-11-30 00:13:43,043 INFO L168 Benchmark]: Toolchain (without parser) took 559.95 ms. Allocated memory is still 104.9 MB. Free memory was 75.4 MB in the beginning and 78.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:43,044 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 104.9 MB. Free memory is still 61.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:13:43,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.24 ms. Allocated memory is still 104.9 MB. Free memory was 75.2 MB in the beginning and 78.0 MB in the end (delta: -2.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:43,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75 ms. Allocated memory is still 104.9 MB. Free memory is still 61.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 542.24 ms. Allocated memory is still 104.9 MB. Free memory was 75.2 MB in the beginning and 78.0 MB in the end (delta: -2.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:13:45,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:13:45,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:13:45,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:13:45,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:13:45,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:13:45,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:13:45,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:13:45,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:13:45,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:13:45,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:13:45,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:13:45,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:13:45,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:13:45,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:13:45,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:13:45,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:13:45,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:13:45,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:13:45,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:13:45,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:13:45,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:13:45,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:13:45,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:13:45,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:13:45,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:13:45,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:13:45,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:13:45,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:13:45,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:13:45,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:13:45,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:13:45,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:13:45,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:13:45,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:13:45,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:13:45,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:13:45,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:13:45,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:13:45,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:13:45,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:13:45,796 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-11-30 00:13:45,849 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:13:45,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:13:45,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:13:45,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:13:45,854 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:13:45,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:13:45,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:13:45,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:13:45,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:13:45,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:13:45,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:13:45,857 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:13:45,857 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:13:45,857 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 00:13:45,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:13:45,857 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:13:45,858 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 00:13:45,858 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 00:13:45,858 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:13:45,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:13:45,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:13:45,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:13:45,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:13:45,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:13:45,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:13:45,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:13:45,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:13:45,860 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 00:13:45,883 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 00:13:45,883 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:13:45,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 00:13:45,884 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8ca06ae5-e9c8-4489-836d-5cff52e79faf/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 -> 2d51915f2a44f0762761fec81bdd888a975b61fb [2020-11-30 00:13:46,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:13:46,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:13:46,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:13:46,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:13:46,428 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:13:46,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2020-11-30 00:13:46,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/cd13d091e/347dddd401da4e40a2ea0e339692e886/FLAG088d7f842 [2020-11-30 00:13:47,312 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:13:47,312 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2020-11-30 00:13:47,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/cd13d091e/347dddd401da4e40a2ea0e339692e886/FLAG088d7f842 [2020-11-30 00:13:47,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/data/cd13d091e/347dddd401da4e40a2ea0e339692e886 [2020-11-30 00:13:47,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:13:47,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:13:47,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:13:47,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:13:47,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:13:47,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:13:47" (1/1) ... [2020-11-30 00:13:47,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2557d100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:47, skipping insertion in model container [2020-11-30 00:13:47,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:13:47" (1/1) ... [2020-11-30 00:13:47,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:13:47,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:13:48,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:13:48,187 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-11-30 00:13:48,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:13:48,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:13:48,281 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:13:48,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:13:48,486 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:13:48,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48 WrapperNode [2020-11-30 00:13:48,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:13:48,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:13:48,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:13:48,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:13:48,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... [2020-11-30 00:13:48,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:13:48,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:13:48,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:13:48,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:13:48,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/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 [2020-11-30 00:13:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 00:13:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:13:48,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-11-30 00:13:48,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 00:13:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 00:13:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 00:13:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 00:13:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 00:13:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 00:13:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-11-30 00:13:48,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-11-30 00:13:48,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-11-30 00:13:48,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-11-30 00:13:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-11-30 00:13:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-11-30 00:13:48,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-11-30 00:13:48,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-11-30 00:13:48,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-11-30 00:13:48,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-11-30 00:13:48,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-11-30 00:13:48,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-11-30 00:13:48,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-11-30 00:13:48,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-11-30 00:13:48,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-11-30 00:13:48,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-11-30 00:13:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-11-30 00:13:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-11-30 00:13:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2020-11-30 00:13:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2020-11-30 00:13:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2020-11-30 00:13:48,802 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2020-11-30 00:13:48,802 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-11-30 00:13:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 00:13:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-11-30 00:13:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-30 00:13:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-11-30 00:13:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 00:13:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 00:13:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 00:13:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 00:13:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 00:13:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 00:13:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 00:13:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 00:13:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 00:13:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 00:13:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 00:13:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 00:13:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 00:13:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 00:13:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 00:13:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 00:13:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 00:13:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 00:13:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 00:13:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 00:13:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 00:13:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 00:13:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 00:13:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 00:13:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 00:13:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 00:13:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 00:13:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 00:13:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 00:13:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 00:13:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 00:13:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 00:13:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 00:13:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 00:13:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 00:13:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 00:13:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 00:13:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 00:13:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 00:13:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 00:13:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 00:13:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 00:13:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 00:13:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 00:13:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 00:13:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 00:13:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 00:13:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 00:13:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 00:13:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 00:13:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 00:13:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 00:13:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 00:13:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 00:13:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 00:13:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 00:13:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 00:13:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 00:13:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-11-30 00:13:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-11-30 00:13:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-11-30 00:13:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-11-30 00:13:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-11-30 00:13:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-11-30 00:13:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-11-30 00:13:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-11-30 00:13:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-11-30 00:13:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-11-30 00:13:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-11-30 00:13:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-11-30 00:13:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-11-30 00:13:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-11-30 00:13:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-11-30 00:13:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-11-30 00:13:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-11-30 00:13:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-11-30 00:13:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-11-30 00:13:49,909 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 00:13:50,436 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 00:13:50,998 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:13:50,999 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-30 00:13:51,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:51 BoogieIcfgContainer [2020-11-30 00:13:51,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:13:51,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:13:51,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:13:51,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:13:51,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:13:47" (1/3) ... [2020-11-30 00:13:51,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7b218d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:13:51, skipping insertion in model container [2020-11-30 00:13:51,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:13:48" (2/3) ... [2020-11-30 00:13:51,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7b218d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:13:51, skipping insertion in model container [2020-11-30 00:13:51,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:51" (3/3) ... [2020-11-30 00:13:51,011 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test7-2.i [2020-11-30 00:13:51,024 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:13:51,030 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2020-11-30 00:13:51,044 INFO L253 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2020-11-30 00:13:51,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:13:51,069 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 00:13:51,069 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:13:51,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:13:51,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:13:51,070 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:13:51,070 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:13:51,070 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:13:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2020-11-30 00:13:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:13:51,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:51,105 INFO L422 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] [2020-11-30 00:13:51,106 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash -667181762, now seen corresponding path program 1 times [2020-11-30 00:13:51,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:51,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265220357] [2020-11-30 00:13:51,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:51,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:13:51,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:51,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:13:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:51,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265220357] [2020-11-30 00:13:51,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:51,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 00:13:51,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861398890] [2020-11-30 00:13:51,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:13:51,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:13:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:13:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:13:51,725 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 5 states. [2020-11-30 00:13:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:51,839 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-11-30 00:13:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:13:51,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-30 00:13:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:51,859 INFO L225 Difference]: With dead ends: 84 [2020-11-30 00:13:51,859 INFO L226 Difference]: Without dead ends: 81 [2020-11-30 00:13:51,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:13:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-30 00:13:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2020-11-30 00:13:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 00:13:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-11-30 00:13:51,926 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 23 [2020-11-30 00:13:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:51,927 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-11-30 00:13:51,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:13:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-11-30 00:13:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:13:51,929 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:51,929 INFO L422 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] [2020-11-30 00:13:52,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 00:13:52,130 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1260306412, now seen corresponding path program 1 times [2020-11-30 00:13:52,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:52,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425630961] [2020-11-30 00:13:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:52,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:13:52,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:52,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:13:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:52,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425630961] [2020-11-30 00:13:52,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:52,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 00:13:52,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411476493] [2020-11-30 00:13:52,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:13:52,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:13:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:13:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:13:52,574 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2020-11-30 00:13:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:52,622 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-11-30 00:13:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:13:52,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-30 00:13:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:52,627 INFO L225 Difference]: With dead ends: 63 [2020-11-30 00:13:52,627 INFO L226 Difference]: Without dead ends: 63 [2020-11-30 00:13:52,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:13:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-30 00:13:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-30 00:13:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 00:13:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-30 00:13:52,647 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2020-11-30 00:13:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:52,647 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-30 00:13:52,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:13:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-11-30 00:13:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:13:52,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:52,649 INFO L422 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] [2020-11-30 00:13:52,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 00:13:52,877 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash -538099043, now seen corresponding path program 1 times [2020-11-30 00:13:52,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:52,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600134412] [2020-11-30 00:13:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:53,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:13:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:53,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:13:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:53,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600134412] [2020-11-30 00:13:53,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:53,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-11-30 00:13:53,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289594149] [2020-11-30 00:13:53,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:13:53,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:13:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:13:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:13:53,330 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 10 states. [2020-11-30 00:13:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:53,450 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2020-11-30 00:13:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:13:53,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-30 00:13:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:53,454 INFO L225 Difference]: With dead ends: 77 [2020-11-30 00:13:53,454 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 00:13:53,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:13:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 00:13:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2020-11-30 00:13:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 00:13:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-11-30 00:13:53,467 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2020-11-30 00:13:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:53,468 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-11-30 00:13:53,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:13:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-11-30 00:13:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:13:53,470 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:53,470 INFO L422 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] [2020-11-30 00:13:53,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 00:13:53,693 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash -414792645, now seen corresponding path program 1 times [2020-11-30 00:13:53,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:53,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254681963] [2020-11-30 00:13:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:53,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:13:53,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:54,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:13:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:54,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254681963] [2020-11-30 00:13:54,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:54,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2020-11-30 00:13:54,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217224219] [2020-11-30 00:13:54,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:13:54,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:13:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:13:54,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:13:54,289 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2020-11-30 00:13:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:54,705 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2020-11-30 00:13:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:13:54,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-30 00:13:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:54,707 INFO L225 Difference]: With dead ends: 111 [2020-11-30 00:13:54,707 INFO L226 Difference]: Without dead ends: 111 [2020-11-30 00:13:54,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:13:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-30 00:13:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2020-11-30 00:13:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 00:13:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-11-30 00:13:54,717 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 24 [2020-11-30 00:13:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:54,717 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-11-30 00:13:54,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:13:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-11-30 00:13:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:13:54,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:54,718 INFO L422 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] [2020-11-30 00:13:54,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 00:13:54,927 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash 26330358, now seen corresponding path program 1 times [2020-11-30 00:13:54,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:54,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85300553] [2020-11-30 00:13:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:55,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:13:55,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:55,202 INFO L384 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 [2020-11-30 00:13:55,203 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:13:55,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:13:55,207 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:13:55,207 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:13:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:55,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:13:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:55,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85300553] [2020-11-30 00:13:55,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:55,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2020-11-30 00:13:55,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680290724] [2020-11-30 00:13:55,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:13:55,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:13:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:13:55,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:13:55,377 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2020-11-30 00:13:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:55,682 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-11-30 00:13:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:13:55,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-30 00:13:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:55,686 INFO L225 Difference]: With dead ends: 86 [2020-11-30 00:13:55,686 INFO L226 Difference]: Without dead ends: 86 [2020-11-30 00:13:55,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:13:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-30 00:13:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2020-11-30 00:13:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-30 00:13:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2020-11-30 00:13:55,708 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 25 [2020-11-30 00:13:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:55,709 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2020-11-30 00:13:55,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:13:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2020-11-30 00:13:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:13:55,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:55,713 INFO L422 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] [2020-11-30 00:13:55,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 00:13:55,927 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:13:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 498121534, now seen corresponding path program 1 times [2020-11-30 00:13:55,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:13:55,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426554861] [2020-11-30 00:13:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 00:13:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:56,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:13:56,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:58,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:14:08,835 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:08,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2)) (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13|))))) (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_1)))))) is different from false [2020-11-30 00:14:08,869 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2)) (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13|))))) (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_1)))))) is different from true [2020-11-30 00:14:08,892 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:08,930 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:08,959 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,021 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,158 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 00:14:09,171 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_6|, |v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_8 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_8 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_8)))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_5 (_ bv0 1)) v_prenex_1) (exists ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_3 |v_entry_point_~#a7~0.base_13|)) (not (= (store v_prenex_3 |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1)))))) (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_3 v_prenex_2))) (= (store v_prenex_3 v_prenex_2 (_ bv0 1)) v_prenex_4))) (not (= (store |c_old(#valid)| v_prenex_5 (_ bv0 1)) v_prenex_4)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_6)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_7))) (= (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_7 (_ bv0 1)) v_prenex_6))))))) is different from false [2020-11-30 00:14:09,232 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_8 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_8 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_8)))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_5 (_ bv0 1)) v_prenex_1) (exists ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_3 |v_entry_point_~#a7~0.base_13|)) (not (= (store v_prenex_3 |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1)))))) (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_3 v_prenex_2))) (= (store v_prenex_3 v_prenex_2 (_ bv0 1)) v_prenex_4))) (not (= (store |c_old(#valid)| v_prenex_5 (_ bv0 1)) v_prenex_4)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_6)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_7))) (= (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_7 (_ bv0 1)) v_prenex_6))))))) is different from true [2020-11-30 00:14:09,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,337 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 00:14:09,344 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_6|, |v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,440 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 00:14:09,446 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_6|, |v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:14:09,542 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 00:14:09,550 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_6|, |v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,612 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 00:14:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:14:09,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426554861] [2020-11-30 00:14:09,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:14:09,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 8] imperfect sequences [] total 10 [2020-11-30 00:14:09,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470048546] [2020-11-30 00:14:09,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:14:09,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:14:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:14:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=33, Unknown=20, NotChecked=30, Total=110 [2020-11-30 00:14:09,697 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 11 states. [2020-11-30 00:14:21,827 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_2 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2)) (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_13|))))) (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_1))))))) is different from false [2020-11-30 00:14:21,855 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_prenex_8 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_4| (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_8 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_8)))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_5 (_ bv0 1)) v_prenex_1) (exists ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_3 |v_entry_point_~#a7~0.base_13|)) (not (= (store v_prenex_3 |v_entry_point_~#a7~0.base_13| (_ bv0 1)) v_prenex_1)))))) (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_3 v_prenex_2))) (= (store v_prenex_3 v_prenex_2 (_ bv0 1)) v_prenex_4))) (not (= (store |c_old(#valid)| v_prenex_5 (_ bv0 1)) v_prenex_4)))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) v_prenex_6)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_7))) (= (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_7 (_ bv0 1)) v_prenex_6))))))) (= |c_old(#valid)| |c_#valid|)) is different from false [2020-11-30 00:14:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:14:54,389 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-11-30 00:14:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:14:54,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-30 00:14:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:14:54,391 INFO L225 Difference]: With dead ends: 83 [2020-11-30 00:14:54,391 INFO L226 Difference]: Without dead ends: 75 [2020-11-30 00:14:54,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=31, Invalid=35, Unknown=22, NotChecked=68, Total=156 [2020-11-30 00:14:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-30 00:14:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-30 00:14:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-30 00:14:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2020-11-30 00:14:54,401 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 24 [2020-11-30 00:14:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:14:54,401 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2020-11-30 00:14:54,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:14:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2020-11-30 00:14:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:14:54,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:14:54,403 INFO L422 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] [2020-11-30 00:14:54,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 00:14:54,611 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:14:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:14:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash -479228267, now seen corresponding path program 1 times [2020-11-30 00:14:54,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:14:54,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767310943] [2020-11-30 00:14:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 00:14:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:14:54,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:14:54,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:14:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:14:54,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:14:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:14:54,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767310943] [2020-11-30 00:14:54,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:14:54,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 00:14:54,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429562807] [2020-11-30 00:14:54,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:14:54,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:14:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:14:54,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:14:54,999 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2020-11-30 00:14:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:14:55,036 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-11-30 00:14:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:14:55,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-11-30 00:14:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:14:55,040 INFO L225 Difference]: With dead ends: 65 [2020-11-30 00:14:55,040 INFO L226 Difference]: Without dead ends: 61 [2020-11-30 00:14:55,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:14:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-30 00:14:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-30 00:14:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-30 00:14:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-11-30 00:14:55,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 25 [2020-11-30 00:14:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:14:55,051 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-11-30 00:14:55,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:14:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-11-30 00:14:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:14:55,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:14:55,056 INFO L422 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] [2020-11-30 00:14:55,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 00:14:55,277 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:14:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:14:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash 720529802, now seen corresponding path program 1 times [2020-11-30 00:14:55,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:14:55,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305529853] [2020-11-30 00:14:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 00:14:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:14:55,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:14:55,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:14:55,569 INFO L384 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 [2020-11-30 00:14:55,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:14:55,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:14:55,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:14:55,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:14:55,680 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:14:55,680 INFO L384 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 [2020-11-30 00:14:55,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:14:55,713 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 00:14:55,715 INFO L545 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. [2020-11-30 00:14:55,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-11-30 00:14:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:14:55,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:14:58,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_24| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_24| (_ bv1 1)) c_probe1_6_~a.base) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_24|) (_ bv0 1))))) is different from false [2020-11-30 00:15:13,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_24| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_24|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_24| (_ bv1 1)) |c_probe1_6_#in~a.base|) (_ bv1 1)) (_ bv0 1)))) is different from false [2020-11-30 00:15:15,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_24| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_24|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_24| (_ bv1 1)) |c_entry_point_~#a7~0.base|) (_ bv1 1)) (_ bv0 1)))) is different from false [2020-11-30 00:15:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:15,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305529853] [2020-11-30 00:15:15,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:15,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2020-11-30 00:15:15,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768507502] [2020-11-30 00:15:15,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 00:15:15,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:15:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:15:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=8, NotChecked=60, Total=182 [2020-11-30 00:15:15,933 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 14 states. [2020-11-30 00:16:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:16:11,538 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-11-30 00:16:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:16:11,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-11-30 00:16:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:16:11,541 INFO L225 Difference]: With dead ends: 61 [2020-11-30 00:16:11,541 INFO L226 Difference]: Without dead ends: 61 [2020-11-30 00:16:11,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=13, NotChecked=96, Total=380 [2020-11-30 00:16:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-30 00:16:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2020-11-30 00:16:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-30 00:16:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-11-30 00:16:11,569 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 29 [2020-11-30 00:16:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:16:11,570 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-11-30 00:16:11,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 00:16:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-11-30 00:16:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:16:11,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:16:11,574 INFO L422 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] [2020-11-30 00:16:11,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 00:16:11,782 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:16:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:16:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 720529803, now seen corresponding path program 1 times [2020-11-30 00:16:11,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:16:11,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768278403] [2020-11-30 00:16:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 00:16:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:16:12,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:16:12,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:16:12,020 INFO L384 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 [2020-11-30 00:16:12,020 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:16:12,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:16:12,036 INFO L384 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 [2020-11-30 00:16:12,036 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:16:12,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:16:12,047 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:16:12,047 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 00:16:14,245 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:16:14,245 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 00:16:14,246 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:16:14,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:16:14,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-11-30 00:16:14,279 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:16:14,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:16:14,300 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:16:14,300 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2020-11-30 00:16:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:16:14,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:16:14,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:20,238 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 00:16:20,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:20,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:20,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:20,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:20,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:28,871 WARN L193 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-11-30 00:16:28,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:16:30,953 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (exists ((v_ldv_malloc_~size_43 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_43) v_probe1_6_~a.base_BEFORE_CALL_12))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0)) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_29| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|)))))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1))) (forall ((|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|)))))) is different from true [2020-11-30 00:16:30,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-11-30 00:16:33,005 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (exists ((v_ldv_malloc_~size_43 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_43) v_probe1_6_~a.base_BEFORE_CALL_12))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0)) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_29| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|)))))) (or (forall ((v_prenex_12 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_prenex_12)))) (exists ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1))))) is different from true [2020-11-30 00:16:37,855 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 00:16:48,042 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 00:16:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:16:48,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768278403] [2020-11-30 00:16:48,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:16:48,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2020-11-30 00:16:48,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980020423] [2020-11-30 00:16:48,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:16:48,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:16:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:16:48,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=9, NotChecked=50, Total=240 [2020-11-30 00:16:48,080 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2020-11-30 00:17:16,334 WARN L193 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2020-11-30 00:17:18,349 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_old(#valid)| |c_#valid|) (exists ((v_probe1_6_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= (_ bv4 32) (select |c_#length| v_probe1_6_~a.base_BEFORE_CALL_8))) (forall ((|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe1_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (exists ((v_ldv_malloc_~size_43 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_43) v_probe1_6_~a.base_BEFORE_CALL_12))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0)) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_29| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|)))))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1))) (forall ((|v_ldv_malloc_#t~malloc12.base_29| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_29|)))))) is different from false [2020-11-30 00:18:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:18:19,741 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-11-30 00:18:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:18:19,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2020-11-30 00:18:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:18:19,752 INFO L225 Difference]: With dead ends: 59 [2020-11-30 00:18:19,752 INFO L226 Difference]: Without dead ends: 59 [2020-11-30 00:18:19,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=89, Invalid=293, Unknown=10, NotChecked=114, Total=506 [2020-11-30 00:18:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-30 00:18:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-30 00:18:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-30 00:18:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-11-30 00:18:19,764 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 29 [2020-11-30 00:18:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:18:19,764 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-11-30 00:18:19,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:18:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-11-30 00:18:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:18:19,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:18:19,765 INFO L422 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] [2020-11-30 00:18:19,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 00:18:19,966 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:18:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:18:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1404304926, now seen corresponding path program 1 times [2020-11-30 00:18:19,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:18:19,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727227842] [2020-11-30 00:18:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 00:18:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:20,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:18:20,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:18:20,260 INFO L384 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 [2020-11-30 00:18:20,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:18:20,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:18:20,264 INFO L545 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. [2020-11-30 00:18:20,265 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 00:18:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:18:28,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:18:37,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_24|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_probe1_6_~p~0.base_38))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| v_probe1_6_~p~0.base_38 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1))))) is different from false [2020-11-30 00:18:37,132 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,145 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from false [2020-11-30 00:18:37,173 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from true [2020-11-30 00:18:37,184 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,199 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,248 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from false [2020-11-30 00:18:37,291 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from true [2020-11-30 00:18:37,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,316 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,345 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,362 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,369 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,386 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,393 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,423 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,450 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,475 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from false [2020-11-30 00:18:37,535 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from true [2020-11-30 00:18:37,623 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:37,632 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_69|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from false [2020-11-30 00:18:37,660 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_69|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) is different from true [2020-11-30 00:18:37,712 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:37,730 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:37,735 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_21], 24=[v_prenex_18]} [2020-11-30 00:18:37,744 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))))) is different from false [2020-11-30 00:18:37,820 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))))) is different from true [2020-11-30 00:18:37,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:37,882 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:37,886 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_21], 24=[v_prenex_18]} [2020-11-30 00:18:37,895 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:37,997 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:38,008 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:38,014 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_21], 24=[v_prenex_18]} [2020-11-30 00:18:38,035 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:38,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_62| (_ BitVec 32))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_ldv_malloc_#res.base_62| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_62|) (_ bv0 1))) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))))) is different from false [2020-11-30 00:18:38,111 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_62| (_ BitVec 32))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_ldv_malloc_#res.base_62| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_62|) (_ bv0 1))) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))))) is different from true [2020-11-30 00:18:38,181 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:38,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:18:38,198 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_21], 24=[v_prenex_18]} [2020-11-30 00:18:38,207 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:38,284 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:18:38,291 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 00:18:38,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_27| (_ BitVec 32))) (let ((.cse1 (store |c_#valid| |v_entry_point_~#a7~0.base_27| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_entry_point_~#a7~0.base_27|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_24|) (_ bv0 1))))) (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_38))) (= (store (store .cse1 v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_27| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2020-11-30 00:18:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:18:38,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727227842] [2020-11-30 00:18:38,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:18:38,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2020-11-30 00:18:38,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082130083] [2020-11-30 00:18:38,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:18:38,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:18:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:18:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=126, Unknown=33, NotChecked=248, Total=462 [2020-11-30 00:18:38,371 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 22 states. [2020-11-30 00:18:57,351 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_probe1_6_~p~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_probe1_6_~p~0.base_BEFORE_CALL_5))) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_69|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) (= |c_old(#valid)| |c_#valid|)) is different from true [2020-11-30 00:18:57,358 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_69|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))))) (= |c_old(#valid)| |c_#valid|)) is different from false [2020-11-30 00:18:57,845 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24)))))))) is different from false [2020-11-30 00:18:57,861 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_69| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38) (_ bv0 1))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_38 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (exists ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse0 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= v_prenex_14 (store (store .cse0 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_35)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|))))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_69|)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (_ bv0 1) (select .cse1 v_prenex_15)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_69| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse2 v_prenex_22))) (= v_prenex_21 (store (store .cse2 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_21)))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse3 v_prenex_25)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse3 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24)))))))) is different from true [2020-11-30 00:18:57,870 WARN L838 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1)) |c_#valid|) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) is different from false [2020-11-30 00:18:57,877 WARN L860 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1)) |c_#valid|) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))))) is different from true [2020-11-30 00:18:57,889 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2020-11-30 00:19:07,972 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1)) |c_#valid|) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2020-11-30 00:19:07,979 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1)) |c_#valid|) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_16 (_ bv1 1)))) (and (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_prenex_15)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_38 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_38 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_35 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_35))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (= (store (store .cse1 v_probe1_6_~p~0.base_35 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_38) (_ bv0 1)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from true [2020-11-30 00:19:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:22,373 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-30 00:19:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:19:22,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2020-11-30 00:19:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:22,374 INFO L225 Difference]: With dead ends: 71 [2020-11-30 00:19:22,374 INFO L226 Difference]: Without dead ends: 60 [2020-11-30 00:19:22,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=93, Invalid=206, Unknown=63, NotChecked=630, Total=992 [2020-11-30 00:19:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-30 00:19:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-11-30 00:19:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-30 00:19:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-30 00:19:22,379 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 33 [2020-11-30 00:19:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:22,379 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-30 00:19:22,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:19:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-30 00:19:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 00:19:22,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:22,381 INFO L422 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] [2020-11-30 00:19:22,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 00:19:22,587 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash -91545904, now seen corresponding path program 1 times [2020-11-30 00:19:22,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:22,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316401906] [2020-11-30 00:19:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:22,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:19:22,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:22,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:22,926 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:22,926 INFO L384 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 14 treesize of output 18 [2020-11-30 00:19:22,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:22,931 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:22,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:22,944 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:19:22,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2020-11-30 00:19:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:22,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316401906] [2020-11-30 00:19:22,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:22,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 00:19:22,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779377794] [2020-11-30 00:19:22,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:19:22,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:19:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:19:22,964 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 7 states. [2020-11-30 00:19:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:23,103 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-30 00:19:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:19:23,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-11-30 00:19:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:23,104 INFO L225 Difference]: With dead ends: 59 [2020-11-30 00:19:23,104 INFO L226 Difference]: Without dead ends: 59 [2020-11-30 00:19:23,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:19:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-30 00:19:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-11-30 00:19:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 00:19:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-11-30 00:19:23,110 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 37 [2020-11-30 00:19:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:23,111 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-11-30 00:19:23,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:19:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-11-30 00:19:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 00:19:23,112 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:23,112 INFO L422 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] [2020-11-30 00:19:23,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 00:19:23,322 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash -91545903, now seen corresponding path program 1 times [2020-11-30 00:19:23,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:23,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709724510] [2020-11-30 00:19:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:23,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:19:23,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:23,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:23,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:23,911 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-11-30 00:19:23,911 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:19:23,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:23,931 INFO L545 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. [2020-11-30 00:19:23,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2020-11-30 00:19:24,150 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:24,151 INFO L384 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 [2020-11-30 00:19:24,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,153 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:19:24,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:24,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,190 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:19:24,191 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2020-11-30 00:19:24,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:24,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:25,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:25,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:25,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:25,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:26,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:26,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:26,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709724510] [2020-11-30 00:19:26,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:26,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2020-11-30 00:19:26,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43475077] [2020-11-30 00:19:26,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 00:19:26,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:19:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:19:26,436 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 14 states. [2020-11-30 00:19:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:26,921 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-11-30 00:19:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:19:26,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-11-30 00:19:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:26,923 INFO L225 Difference]: With dead ends: 58 [2020-11-30 00:19:26,923 INFO L226 Difference]: Without dead ends: 58 [2020-11-30 00:19:26,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:19:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-30 00:19:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-11-30 00:19:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-30 00:19:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-30 00:19:26,928 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 37 [2020-11-30 00:19:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:26,928 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-30 00:19:26,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 00:19:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-30 00:19:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:19:26,929 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:26,929 INFO L422 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] [2020-11-30 00:19:27,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 00:19:27,139 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1457044639, now seen corresponding path program 1 times [2020-11-30 00:19:27,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:27,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434393791] [2020-11-30 00:19:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:27,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:19:27,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:27,442 INFO L384 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 [2020-11-30 00:19:27,443 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:27,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:27,446 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:19:27,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-30 00:19:27,542 INFO L384 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 [2020-11-30 00:19:27,543 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:27,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:27,546 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:19:27,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-30 00:19:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:27,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:27,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2020-11-30 00:19:27,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 00:19:27,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:27,792 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 00:19:27,792 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-11-30 00:19:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:27,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434393791] [2020-11-30 00:19:27,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:27,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2020-11-30 00:19:27,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701757831] [2020-11-30 00:19:27,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:19:27,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:19:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:19:27,848 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 11 states. [2020-11-30 00:19:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:28,133 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-11-30 00:19:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:19:28,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-11-30 00:19:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:28,134 INFO L225 Difference]: With dead ends: 57 [2020-11-30 00:19:28,134 INFO L226 Difference]: Without dead ends: 57 [2020-11-30 00:19:28,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:19:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-30 00:19:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-11-30 00:19:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-30 00:19:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-11-30 00:19:28,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 38 [2020-11-30 00:19:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:28,138 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-11-30 00:19:28,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:19:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-11-30 00:19:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 00:19:28,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:28,140 INFO L422 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] [2020-11-30 00:19:28,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 00:19:28,354 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2076256016, now seen corresponding path program 1 times [2020-11-30 00:19:28,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:28,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698648422] [2020-11-30 00:19:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:28,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:19:28,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:28,814 INFO L384 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 [2020-11-30 00:19:28,815 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:28,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:28,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:19:28,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-11-30 00:19:29,033 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-30 00:19:29,033 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:29,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:29,056 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:19:29,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-11-30 00:19:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:29,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:29,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2020-11-30 00:19:29,458 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:19:29,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:29,490 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:19:29,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2020-11-30 00:19:29,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 00:19:29,803 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:19:29,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:29,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:19:29,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:19:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:29,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698648422] [2020-11-30 00:19:29,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:29,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2020-11-30 00:19:29,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750662615] [2020-11-30 00:19:29,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:19:29,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:19:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:19:29,917 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 22 states. [2020-11-30 00:19:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:30,880 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-30 00:19:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:19:30,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-11-30 00:19:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:30,882 INFO L225 Difference]: With dead ends: 56 [2020-11-30 00:19:30,882 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 00:19:30,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-11-30 00:19:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 00:19:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-11-30 00:19:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-30 00:19:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-11-30 00:19:30,885 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 39 [2020-11-30 00:19:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:30,885 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-11-30 00:19:30,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:19:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-11-30 00:19:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:19:30,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:30,886 INFO L422 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] [2020-11-30 00:19:31,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 00:19:31,099 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1456366955, now seen corresponding path program 1 times [2020-11-30 00:19:31,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:31,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331555175] [2020-11-30 00:19:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:31,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:19:31,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:31,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:31,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331555175] [2020-11-30 00:19:31,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:31,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 00:19:31,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684367311] [2020-11-30 00:19:31,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:19:31,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:19:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:19:31,378 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 5 states. [2020-11-30 00:19:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:19:31,393 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-11-30 00:19:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:19:31,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-30 00:19:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:19:31,395 INFO L225 Difference]: With dead ends: 58 [2020-11-30 00:19:31,395 INFO L226 Difference]: Without dead ends: 58 [2020-11-30 00:19:31,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:19:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-30 00:19:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-11-30 00:19:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-30 00:19:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2020-11-30 00:19:31,398 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 38 [2020-11-30 00:19:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:19:31,399 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2020-11-30 00:19:31,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:19:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-11-30 00:19:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 00:19:31,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:19:31,399 INFO L422 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] [2020-11-30 00:19:31,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 00:19:31,611 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:19:31,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:19:31,611 INFO L82 PathProgramCache]: Analyzing trace with hash 433789337, now seen corresponding path program 1 times [2020-11-30 00:19:31,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:19:31,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347830059] [2020-11-30 00:19:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-30 00:19:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:31,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:19:31,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:19:31,845 INFO L384 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 [2020-11-30 00:19:31,846 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:31,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:31,848 INFO L545 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. [2020-11-30 00:19:31,848 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 00:19:31,884 INFO L384 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 [2020-11-30 00:19:31,884 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:19:31,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:19:31,887 INFO L545 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. [2020-11-30 00:19:31,887 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 00:19:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:19:46,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_44|)) (= (select .cse0 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| |c_#valid|))) is different from false [2020-11-30 00:19:46,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_44|)) (= (select .cse0 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store |c_#valid| |c_entry_point_~#a7~0.base| (_ bv0 1))))) is different from false [2020-11-30 00:19:48,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,718 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from false [2020-11-30 00:19:48,740 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from true [2020-11-30 00:19:48,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,757 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,780 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from false [2020-11-30 00:19:48,842 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) is different from true [2020-11-30 00:19:48,853 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,863 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,885 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,915 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,936 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,962 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:48,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:48,984 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,006 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,027 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,033 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,049 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,054 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,071 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,083 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))))) is different from false [2020-11-30 00:19:49,123 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))))) is different from true [2020-11-30 00:19:49,203 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,209 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_127|) (_ bv0 1))))) is different from false [2020-11-30 00:19:49,240 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_127|) (_ bv0 1))))) is different from true [2020-11-30 00:19:49,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,309 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_32, v_prenex_30], 24=[v_prenex_29]} [2020-11-30 00:19:49,317 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_32 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_33 (_ BitVec 32))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_33 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_32)) (forall ((v_prenex_34 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse0 v_prenex_34) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_32)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_33)))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse1 v_prenex_36) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (exists ((|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_26 (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) v_prenex_31 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70))) (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (= (_ bv0 1) (select v_prenex_29 |v_entry_point_~#a7~0.base_44|)) (not (= v_prenex_26 (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))) (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse3 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_29 v_prenex_28))) (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select .cse3 v_prenex_27) (_ bv0 1)))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)))))) is different from false [2020-11-30 00:19:49,396 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_32 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_33 (_ BitVec 32))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_33 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_32)) (forall ((v_prenex_34 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse0 v_prenex_34) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_32)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_33)))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse1 v_prenex_36) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (exists ((|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_26 (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) v_prenex_31 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70))) (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (= (_ bv0 1) (select v_prenex_29 |v_entry_point_~#a7~0.base_44|)) (not (= v_prenex_26 (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))) (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse3 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_29 v_prenex_28))) (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select .cse3 v_prenex_27) (_ bv0 1)))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)))))) is different from true [2020-11-30 00:19:49,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,453 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_32, v_prenex_30], 24=[v_prenex_29]} [2020-11-30 00:19:49,461 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,604 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,607 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_32, v_prenex_30], 24=[v_prenex_29]} [2020-11-30 00:19:49,615 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,679 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#res.base_110|) (_ bv0 1))) (exists ((v_prenex_32 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_33 (_ BitVec 32))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_33 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_32)) (forall ((v_prenex_34 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse0 v_prenex_34) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_32)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_33)))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse1 v_prenex_36) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (exists ((|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_26 (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) v_prenex_31 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70))) (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (= (_ bv0 1) (select v_prenex_29 |v_entry_point_~#a7~0.base_44|)) (not (= v_prenex_26 (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))) (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse3 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_29 v_prenex_28))) (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select .cse3 v_prenex_27) (_ bv0 1)))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |v_ldv_malloc_#res.base_110| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))))) is different from true [2020-11-30 00:19:49,770 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,781 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:19:49,784 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_32, v_prenex_30], 24=[v_prenex_29]} [2020-11-30 00:19:49,794 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,868 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:19:49,877 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 00:19:49,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_46| (_ BitVec 32)) (v_probe1_6_~p~0.base_70 (_ BitVec 32))) (let ((.cse1 (store |c_#valid| |v_entry_point_~#a7~0.base_46| (_ bv1 1)))) (or (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (not (= (store (store .cse0 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_44|)) (= (select .cse0 v_probe1_6_~p~0.base_67) (_ bv0 1))))) (not (= (select .cse1 v_probe1_6_~p~0.base_70) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_entry_point_~#a7~0.base_46|))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_46| (_ bv0 1)))))) is different from false [2020-11-30 00:19:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:19:49,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347830059] [2020-11-30 00:19:49,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:19:49,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2020-11-30 00:19:49,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439594821] [2020-11-30 00:19:49,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:19:49,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:19:49,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:19:49,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=114, Unknown=23, NotChecked=270, Total=462 [2020-11-30 00:19:49,950 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 22 states. [2020-11-30 00:20:18,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_32 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_33 (_ BitVec 32))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_33 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_32)) (forall ((v_prenex_34 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_35 (_ bv1 1)))) (or (not (= (select .cse0 v_prenex_34) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_32)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_33)))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse1 v_prenex_36) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (exists ((|v_probe1_6_#t~ret40.base_127| (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_26 (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70 (_ bv0 1)) v_prenex_31 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_70))) (exists ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (and (= (_ bv0 1) (select v_prenex_29 |v_entry_point_~#a7~0.base_44|)) (not (= v_prenex_26 (store (store .cse2 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))) (= (select .cse2 v_probe1_6_~p~0.base_67) (_ bv0 1))))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse3 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (not (= (_ bv0 1) (select v_prenex_29 v_prenex_28))) (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select .cse3 v_prenex_27) (_ bv0 1)))))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_127|)) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_127| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1))) is different from false [2020-11-30 00:20:18,422 WARN L838 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1)) |c_#valid|) (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1))) is different from false [2020-11-30 00:20:18,430 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|)) is different from false [2020-11-30 00:20:18,436 WARN L860 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|))) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|)) is different from true [2020-11-30 00:20:30,721 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1)) |c_#valid|) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)))) is different from false [2020-11-30 00:20:30,736 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1)) |c_#valid|) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse0 v_prenex_27) (_ bv0 1))))) (exists ((v_probe1_6_~p~0.base_70 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_70 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) v_prenex_26)) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_70) (_ bv0 1)) (forall ((v_probe1_6_~p~0.base_67 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_44| (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44| (_ bv1 1)))) (or (not (= (select .cse1 v_probe1_6_~p~0.base_67) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_44|))) (= v_prenex_26 (store (store .cse1 v_probe1_6_~p~0.base_67 (_ bv0 1)) |v_entry_point_~#a7~0.base_44| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_16| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)))) is different from true [2020-11-30 00:20:33,712 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2020-11-30 00:20:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:20:58,985 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2020-11-30 00:20:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:20:58,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-11-30 00:20:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:20:58,986 INFO L225 Difference]: With dead ends: 59 [2020-11-30 00:20:58,986 INFO L226 Difference]: Without dead ends: 48 [2020-11-30 00:20:58,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=103, Invalid=237, Unknown=54, NotChecked=598, Total=992 [2020-11-30 00:20:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-30 00:20:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-30 00:20:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-30 00:20:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2020-11-30 00:20:58,989 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 39 [2020-11-30 00:20:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:20:58,990 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2020-11-30 00:20:58,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:20:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2020-11-30 00:20:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 00:20:58,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:20:58,990 INFO L422 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] [2020-11-30 00:20:59,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 00:20:59,199 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:20:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:20:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash 60573377, now seen corresponding path program 1 times [2020-11-30 00:20:59,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:20:59,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335657821] [2020-11-30 00:20:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-11-30 00:20:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:59,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:20:59,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:20:59,407 INFO L384 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 [2020-11-30 00:20:59,407 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:20:59,410 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,410 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:20:59,515 INFO L384 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 [2020-11-30 00:20:59,515 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:20:59,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,523 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 00:20:59,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-30 00:20:59,594 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:20:59,596 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:20:59,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 00:20:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:20:59,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:20:59,831 INFO L384 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 [2020-11-30 00:20:59,832 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:20:59,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:20:59,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:20:59,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 00:21:00,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:21:00,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:21:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:21:00,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335657821] [2020-11-30 00:21:00,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:00,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 13 [2020-11-30 00:21:00,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836761815] [2020-11-30 00:21:00,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 00:21:00,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:21:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:21:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:21:00,635 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand 14 states. [2020-11-30 00:21:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:21:01,255 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2020-11-30 00:21:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:21:01,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-30 00:21:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:21:01,257 INFO L225 Difference]: With dead ends: 47 [2020-11-30 00:21:01,257 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 00:21:01,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-11-30 00:21:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 00:21:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-30 00:21:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 00:21:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2020-11-30 00:21:01,260 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 40 [2020-11-30 00:21:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:21:01,260 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2020-11-30 00:21:01,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 00:21:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2020-11-30 00:21:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:21:01,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:21:01,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:21:01,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-30 00:21:01,462 INFO L429 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err4ASSERT_VIOLATIONMEMORY_FREE]=== [2020-11-30 00:21:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:21:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1241521659, now seen corresponding path program 1 times [2020-11-30 00:21:01,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:21:01,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273931461] [2020-11-30 00:21:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-30 00:21:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:21:01,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 00:21:01,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:21:01,787 INFO L384 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 [2020-11-30 00:21:01,788 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:21:01,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:01,790 INFO L545 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. [2020-11-30 00:21:01,791 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 00:21:01,875 INFO L384 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 [2020-11-30 00:21:01,876 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:21:01,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:01,881 INFO L545 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. [2020-11-30 00:21:01,881 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 00:21:01,963 INFO L384 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 [2020-11-30 00:21:01,963 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:21:01,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:01,978 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:21:01,978 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2020-11-30 00:21:02,086 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:02,086 INFO L384 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 23 treesize of output 27 [2020-11-30 00:21:02,089 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:21:02,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:02,099 INFO L545 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. [2020-11-30 00:21:02,099 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:12 [2020-11-30 00:21:08,160 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2020-11-30 00:21:10,210 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-30 00:21:12,290 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-30 00:21:14,356 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-30 00:21:14,376 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:14,376 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2020-11-30 00:21:14,377 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 00:21:14,378 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 00:21:14,380 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 00:21:14,382 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 00:21:14,383 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:21:14,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:21:14,412 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:21:14,412 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:23 [2020-11-30 00:21:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:21:30,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:21:39,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| |c_#valid|) (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (select |c_old(#valid)| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))))))) is different from false [2020-11-30 00:21:47,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_entry_point_~#a7~0.base|) |c_entry_point_~#a7~0.offset|) (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1))) (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (select |c_old(#valid)| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))))))) is different from false [2020-11-30 00:21:47,673 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,677 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from false [2020-11-30 00:21:47,692 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from true [2020-11-30 00:21:47,699 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,714 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,728 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,733 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from false [2020-11-30 00:21:47,756 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from true [2020-11-30 00:21:47,764 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,767 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,775 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,779 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,788 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,803 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))))) is different from false [2020-11-30 00:21:47,826 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))))) is different from true [2020-11-30 00:21:47,839 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 00:21:47,852 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_32|]} [2020-11-30 00:21:47,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from false [2020-11-30 00:21:47,873 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) is different from true [2020-11-30 00:21:48,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_probe1_6_~p~0.base_84))) (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (select |c_old(#valid)| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1))))) is different from false [2020-11-30 00:21:48,190 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,197 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from false [2020-11-30 00:21:48,236 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from true [2020-11-30 00:21:48,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,251 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,265 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,270 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,286 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,291 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from false [2020-11-30 00:21:48,318 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from true [2020-11-30 00:21:48,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,334 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,363 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,394 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,416 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,437 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,462 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,484 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,506 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from false [2020-11-30 00:21:48,531 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from true [2020-11-30 00:21:48,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:48,622 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |v_ldv_malloc_#t~malloc12.base_108|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_108|))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from false [2020-11-30 00:21:48,651 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |v_ldv_malloc_#t~malloc12.base_108|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_108|))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) is different from true [2020-11-30 00:21:48,695 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,708 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,714 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_46, v_prenex_49], 24=[v_prenex_47]} [2020-11-30 00:21:48,723 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 7=[|v_old(#valid)_BEFORE_CALL_36|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (v_prenex_48 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_46 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_47 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store v_prenex_47 v_prenex_44 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_prenex_45))) (not (= (_ bv0 1) (select v_prenex_47 v_prenex_44))) (= v_prenex_46 (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108|) (_ bv0 1)) (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_108|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_46)) (forall ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store v_prenex_47 |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_43)) (= (_ bv0 1) (select v_prenex_47 |v_disconnect_6_#in~a.base_7|))))) (= (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_43) (not (= (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_54 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 v_prenex_53)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_54)) (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse2 v_prenex_53 (_ bv0 1)) v_prenex_54 (_ bv0 1))))))) (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_51 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_51))) (not (= (_ bv0 1) (select .cse3 v_prenex_52))) (= (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)) v_prenex_49)))) (not (= v_prenex_49 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50) (_ bv0 1)))))) is different from false [2020-11-30 00:21:48,802 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (v_prenex_48 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_46 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_47 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store v_prenex_47 v_prenex_44 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_prenex_45))) (not (= (_ bv0 1) (select v_prenex_47 v_prenex_44))) (= v_prenex_46 (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108|) (_ bv0 1)) (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_108|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_46)) (forall ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store v_prenex_47 |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_43)) (= (_ bv0 1) (select v_prenex_47 |v_disconnect_6_#in~a.base_7|))))) (= (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_43) (not (= (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_54 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 v_prenex_53)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_54)) (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse2 v_prenex_53 (_ bv0 1)) v_prenex_54 (_ bv0 1))))))) (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_51 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_51))) (not (= (_ bv0 1) (select .cse3 v_prenex_52))) (= (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)) v_prenex_49)))) (not (= v_prenex_49 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50) (_ bv0 1)))))) is different from true [2020-11-30 00:21:48,862 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,880 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_46, v_prenex_49], 24=[v_prenex_47]} [2020-11-30 00:21:48,888 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 7=[|v_old(#valid)_BEFORE_CALL_36|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:48,975 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,987 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:48,991 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_46, v_prenex_49], 24=[v_prenex_47]} [2020-11-30 00:21:49,002 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 7=[|v_old(#valid)_BEFORE_CALL_36|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:49,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (exists ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (v_prenex_48 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_46 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_47 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store v_prenex_47 v_prenex_44 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_prenex_45))) (not (= (_ bv0 1) (select v_prenex_47 v_prenex_44))) (= v_prenex_46 (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108|) (_ bv0 1)) (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_108|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_46)) (forall ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store v_prenex_47 |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_43)) (= (_ bv0 1) (select v_prenex_47 |v_disconnect_6_#in~a.base_7|))))) (= (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_43) (not (= (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84) (_ bv0 1))))))) (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_54 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 v_prenex_53)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_54)) (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse2 v_prenex_53 (_ bv0 1)) v_prenex_54 (_ bv0 1))))))) (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_51 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_51))) (not (= (_ bv0 1) (select .cse3 v_prenex_52))) (= (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)) v_prenex_49)))) (not (= v_prenex_49 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50) (_ bv0 1)))))) is different from false [2020-11-30 00:21:49,084 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_109| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_109| (_ bv1 1)) (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_109|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_109|) (_ bv0 1))) (exists ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (v_prenex_48 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_46 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_47 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store v_prenex_47 v_prenex_44 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_prenex_45))) (not (= (_ bv0 1) (select v_prenex_47 v_prenex_44))) (= v_prenex_46 (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108|) (_ bv0 1)) (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_108|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_46)) (forall ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store v_prenex_47 |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_43)) (= (_ bv0 1) (select v_prenex_47 |v_disconnect_6_#in~a.base_7|))))) (= (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_43) (not (= (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84) (_ bv0 1))))))) (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_54 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 v_prenex_53)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_54)) (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse2 v_prenex_53 (_ bv0 1)) v_prenex_54 (_ bv0 1))))))) (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_51 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_51))) (not (= (_ bv0 1) (select .cse3 v_prenex_52))) (= (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)) v_prenex_49)))) (not (= v_prenex_49 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50) (_ bv0 1)))))) is different from true [2020-11-30 00:21:49,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:49,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 00:21:49,154 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_46, v_prenex_49], 24=[v_prenex_47]} [2020-11-30 00:21:49,162 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 7=[|v_old(#valid)_BEFORE_CALL_36|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:49,209 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 00:21:49,215 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_31|], 24=[|v_old(#valid)_BEFORE_CALL_33|]} [2020-11-30 00:21:49,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_108|))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))) (= (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_108| (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from false [2020-11-30 00:21:49,239 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_108|))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))) (= (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_108| (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) is different from true [2020-11-30 00:21:49,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_58| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_entry_point_~#a7~0.base_58| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_84))) (not (= (select |c_#valid| |v_entry_point_~#a7~0.base_58|) (_ bv0 1))) (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)) (= (select |c_old(#valid)| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_entry_point_~#a7~0.base_58| (_ bv0 1)))))) is different from false [2020-11-30 00:21:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:21:49,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273931461] [2020-11-30 00:21:49,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:21:49,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 19] imperfect sequences [] total 33 [2020-11-30 00:21:49,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950446406] [2020-11-30 00:21:49,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-30 00:21:49,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:21:49,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-30 00:21:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=259, Unknown=56, NotChecked=720, Total=1122 [2020-11-30 00:21:49,346 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 34 states. [2020-11-30 00:22:18,464 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_probe1_6_#in~a.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_36| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~a.offset_BEFORE_CALL_36 (_ BitVec 32)) (v_probe1_6_~a.base_BEFORE_CALL_48 (_ BitVec 32)) (|v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_108| (_ BitVec 32)) (v_prenex_48 (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (v_prenex_46 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_47 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store v_prenex_47 v_prenex_44 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_prenex_45))) (not (= (_ bv0 1) (select v_prenex_47 v_prenex_44))) (= v_prenex_46 (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108|) (_ bv0 1)) (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_108| (_ bv1 1)) (select (select (store v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48 (store (select v_prenex_48 v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |v_ldv_malloc_#t~malloc12.base_108|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_46)) (forall ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (or (exists ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store v_prenex_47 |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_43)) (= (_ bv0 1) (select v_prenex_47 |v_disconnect_6_#in~a.base_7|))))) (= (store (store |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)) v_prenex_43) (not (= (select |v_old(#valid)_BEFORE_CALL_36| v_probe1_6_~p~0.base_84) (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48 (store (select |#memory_$Pointer$.base| v_probe1_6_~a.base_BEFORE_CALL_48) v_probe1_6_~a.offset_BEFORE_CALL_36 |c_ldv_malloc_#res.base|)) |v_probe1_6_#in~a.base_BEFORE_CALL_36|) |v_probe1_6_#in~a.offset_BEFORE_CALL_30|) (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1))) (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_54 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 v_prenex_53)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_54)) (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse2 v_prenex_53 (_ bv0 1)) v_prenex_54 (_ bv0 1))))))) (exists ((v_prenex_50 (_ BitVec 32)) (v_prenex_49 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_51 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_51))) (not (= (_ bv0 1) (select .cse3 v_prenex_52))) (= (store (store .cse3 v_prenex_52 (_ bv0 1)) v_prenex_51 (_ bv0 1)) v_prenex_49)))) (not (= v_prenex_49 (store (store |v_old(#valid)_BEFORE_CALL_36| v_prenex_50 (_ bv0 1)) |v_probe1_6_#in~a.base_BEFORE_CALL_36| (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_36| v_prenex_50) (_ bv0 1)))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1))) is different from false [2020-11-30 00:22:18,476 WARN L838 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1)) |c_#valid|) (= c_probe1_6_~a.offset |c_probe1_6_#in~a.offset|) (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))))))))) is different from false [2020-11-30 00:22:18,483 WARN L860 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1)) |c_#valid|) (= c_probe1_6_~a.offset |c_probe1_6_#in~a.offset|) (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset |c_probe1_6_#t~ret40.base|)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))))))))) is different from true [2020-11-30 00:22:18,495 WARN L838 $PredicateComparison]: unable to prove that (and (= c_probe1_6_~a.offset |c_probe1_6_#in~a.offset|) (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= |c_probe1_6_#in~a.base| c_probe1_6_~a.base) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|) (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|#memory_$Pointer$.base| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select (store |#memory_$Pointer$.base| c_probe1_6_~a.base (store (select |#memory_$Pointer$.base| c_probe1_6_~a.base) c_probe1_6_~a.offset c_probe1_6_~p~0.base)) |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))))))))) is different from false [2020-11-30 00:22:31,816 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|))) (and (forall ((|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_33| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_probe1_6_#in~a.base|) |c_probe1_6_#in~a.offset|) (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1))) (exists ((v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_33| v_prenex_44 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_31| (store (store .cse0 v_prenex_45 (_ bv0 1)) v_prenex_44 (_ bv0 1)))) (= (_ bv0 1) (select .cse0 v_prenex_45)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| v_prenex_44))))) (exists ((v_prenex_43 (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_84 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_84)) (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_81))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_33| |v_disconnect_6_#in~a.base_7|))) (= v_prenex_43 (store (store .cse1 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)))))) (not (= v_prenex_43 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_84 (_ bv0 1)) |c_probe1_6_#in~a.base| (_ bv0 1)))))))) (= (store |c_old(#valid)| .cse2 (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| .cse2)))) is different from false [2020-11-30 00:22:33,995 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (exists ((v_probe1_6_~p~0.base_BEFORE_CALL_19 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_probe1_6_~p~0.base_BEFORE_CALL_19))) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) (= |c_old(#valid)| |c_#valid|)) is different from false [2020-11-30 00:22:34,003 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (exists ((v_probe1_6_~p~0.base_BEFORE_CALL_19 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_probe1_6_~p~0.base_BEFORE_CALL_19))) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1))))) (= |c_old(#valid)| |c_#valid|)) is different from true [2020-11-30 00:22:34,013 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (= |c_old(#valid)| |c_#valid|) (= c_disconnect_6_~a.offset |c_disconnect_6_#in~a.offset|) (= |c_disconnect_6_#in~a.base| c_disconnect_6_~a.base) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| c_disconnect_6_~a.base) c_disconnect_6_~a.offset) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|)))))))) is different from false [2020-11-30 00:22:34,026 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) |c_disconnect_6_#t~mem43.base|)) is different from false [2020-11-30 00:22:34,031 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= (store (store |c_#valid| |c_disconnect_6_#t~mem43.base| (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) |c_disconnect_6_#t~mem43.base|)) is different from true [2020-11-30 00:22:34,038 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_entry_point_~#a7~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (not (= |v_entry_point_~#a7~0.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| |v_entry_point_~#a7~0.base_BEFORE_CALL_20|) |v_entry_point_~#a7~0.offset_BEFORE_CALL_11|)))) (forall ((|v_old(#valid)_BEFORE_CALL_32| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_31| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_disconnect_6_#in~a.base_7| (_ BitVec 32)) (v_probe1_6_~p~0.base_81 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_81 (_ bv0 1)) |v_disconnect_6_#in~a.base_7| (_ bv0 1)) v_prenex_40) (not (= (select |v_old(#valid)_BEFORE_CALL_32| |v_disconnect_6_#in~a.base_7|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_81)))))) (not (= v_prenex_40 (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_disconnect_6_#in~a.base| (_ bv0 1)))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_32| v_prenex_41 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_32| v_prenex_41) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_prenex_42)) (not (= (store (store .cse1 v_prenex_42 (_ bv0 1)) v_prenex_41 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_31|))))) (= |v_old(#valid)_BEFORE_CALL_31| (store |c_#valid| |c_disconnect_6_#in~a.base| (_ bv0 1))))) (= (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_disconnect_6_#in~a.base|) |c_disconnect_6_#in~a.offset|) (_ bv0 1)) |c_#valid|)) is different from false [2020-11-30 00:22:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:44,423 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2020-11-30 00:22:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-30 00:22:44,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 46 [2020-11-30 00:22:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:22:44,424 INFO L225 Difference]: With dead ends: 46 [2020-11-30 00:22:44,424 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:22:44,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 23 IntricatePredicates, 2 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=154, Invalid=505, Unknown=135, NotChecked=1656, Total=2450 [2020-11-30 00:22:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:22:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:22:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:22:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:22:44,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2020-11-30 00:22:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:22:44,427 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:22:44,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-30 00:22:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:22:44,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:22:44,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-30 00:22:44,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:22:44 BoogieIcfgContainer [2020-11-30 00:22:44,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:22:44,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:22:44,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:22:44,642 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:22:44,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:51" (3/4) ... [2020-11-30 00:22:44,646 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:22:44,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2020-11-30 00:22:44,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 00:22:44,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2020-11-30 00:22:44,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f6 [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2020-11-30 00:22:44,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2020-11-30 00:22:44,656 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g6 [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2020-11-30 00:22:44,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2020-11-30 00:22:44,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-11-30 00:22:44,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2020-11-30 00:22:44,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-30 00:22:44,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2020-11-30 00:22:44,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2020-11-30 00:22:44,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2020-11-30 00:22:44,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2020-11-30 00:22:44,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_6 [2020-11-30 00:22:44,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe1_6 [2020-11-30 00:22:44,670 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2020-11-30 00:22:44,671 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-11-30 00:22:44,671 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 00:22:44,672 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 00:22:44,672 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:22:44,729 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8ca06ae5-e9c8-4489-836d-5cff52e79faf/bin/uautomizer/witness.graphml [2020-11-30 00:22:44,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:22:44,731 INFO L168 Benchmark]: Toolchain (without parser) took 537206.35 ms. Allocated memory was 79.7 MB in the beginning and 144.7 MB in the end (delta: 65.0 MB). Free memory was 44.8 MB in the beginning and 95.9 MB in the end (delta: -51.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,732 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 79.7 MB. Free memory was 62.9 MB in the beginning and 62.8 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:22:44,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.14 ms. Allocated memory is still 79.7 MB. Free memory was 64.9 MB in the beginning and 58.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,733 INFO L168 Benchmark]: Boogie Preprocessor took 202.74 ms. Allocated memory is still 79.7 MB. Free memory was 58.9 MB in the beginning and 54.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,733 INFO L168 Benchmark]: RCFGBuilder took 2307.90 ms. Allocated memory was 79.7 MB in the beginning and 98.6 MB in the end (delta: 18.9 MB). Free memory was 54.0 MB in the beginning and 72.8 MB in the end (delta: -18.8 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,734 INFO L168 Benchmark]: TraceAbstraction took 533637.01 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 72.8 MB in the beginning and 101.8 MB in the end (delta: -29.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,734 INFO L168 Benchmark]: Witness Printer took 88.57 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 95.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:44,737 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 79.7 MB. Free memory was 62.9 MB in the beginning and 62.8 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 945.14 ms. Allocated memory is still 79.7 MB. Free memory was 64.9 MB in the beginning and 58.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 202.74 ms. Allocated memory is still 79.7 MB. Free memory was 58.9 MB in the beginning and 54.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2307.90 ms. Allocated memory was 79.7 MB in the beginning and 98.6 MB in the end (delta: 18.9 MB). Free memory was 54.0 MB in the beginning and 72.8 MB in the end (delta: -18.8 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 533637.01 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 72.8 MB in the beginning and 101.8 MB in the end (delta: -29.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * Witness Printer took 88.57 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 95.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 790]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 781]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 774]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 774]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 81 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 373 locations, 81 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 533.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 363.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 837 SDtfs, 785 SDslu, 3156 SDs, 0 SdLazy, 2018 SolverSat, 210 SolverUnsat, 197 SolverUnknown, 0 SolverNotchecked, 300.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1208 GetRequests, 890 SyntacticMatches, 54 SemanticMatches, 264 ConstructedPredicates, 60 IntricatePredicates, 4 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 213.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 92 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 161.6s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1108 ConstructedInterpolants, 227 QuantifiedInterpolants, 513971 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...