./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 b099a717aded091d5866869f3c84b7af6ed3ff48 .................................................................................................................................. 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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 b099a717aded091d5866869f3c84b7af6ed3ff48 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:30:40,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:30:40,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:30:40,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:30:40,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:30:40,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:30:40,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:30:40,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:30:40,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:30:40,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:30:40,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:30:40,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:30:40,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:30:40,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:30:40,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:30:40,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:30:40,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:30:40,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:30:40,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:30:40,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:30:40,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:30:40,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:30:40,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:30:40,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:30:40,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:30:40,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:30:40,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:30:40,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:30:40,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:30:40,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:30:40,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:30:40,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:30:40,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:30:40,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:30:40,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:30:40,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:30:40,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:30:40,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:30:40,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:30:40,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:30:40,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:30:40,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-30 01:30:40,678 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:30:40,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:30:40,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:30:40,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:30:40,681 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:30:40,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:30:40,681 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:30:40,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:30:40,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:30:40,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:30:40,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:30:40,683 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:30:40,683 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:30:40,683 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:30:40,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:30:40,684 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:30:40,684 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:30:40,684 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:30:40,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:30:40,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:30:40,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:30:40,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:30:40,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:30:40,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:30:40,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:30:40,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:30:40,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:30:40,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:30:40,688 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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 -> b099a717aded091d5866869f3c84b7af6ed3ff48 [2020-11-30 01:30:41,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:30:41,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:30:41,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:30:41,066 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:30:41,067 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:30:41,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2020-11-30 01:30:41,169 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/b1cbfca4d/f7bb0f087c3a4017bdca938ac129e077/FLAGbe7fd9c65 [2020-11-30 01:30:41,864 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:30:41,866 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2020-11-30 01:30:41,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/b1cbfca4d/f7bb0f087c3a4017bdca938ac129e077/FLAGbe7fd9c65 [2020-11-30 01:30:42,076 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/b1cbfca4d/f7bb0f087c3a4017bdca938ac129e077 [2020-11-30 01:30:42,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:30:42,084 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:30:42,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:30:42,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:30:42,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:30:42,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:30:42" (1/1) ... [2020-11-30 01:30:42,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2455f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:42, skipping insertion in model container [2020-11-30 01:30:42,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:30:42" (1/1) ... [2020-11-30 01:30:42,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:30:42,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:30:42,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:30:42,727 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 01:30:42,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e969c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:42, skipping insertion in model container [2020-11-30 01:30:42,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:30:42,729 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-11-30 01:30:42,732 INFO L168 Benchmark]: Toolchain (without parser) took 645.94 ms. Allocated memory is still 88.1 MB. Free memory was 52.7 MB in the beginning and 61.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:30:42,733 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 71.3 MB. Free memory was 45.9 MB in the beginning and 45.9 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:30:42,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.51 ms. Allocated memory is still 88.1 MB. Free memory was 52.6 MB in the beginning and 61.4 MB in the end (delta: -8.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:30:42,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.39 ms. Allocated memory is still 71.3 MB. Free memory was 45.9 MB in the beginning and 45.9 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 641.51 ms. Allocated memory is still 88.1 MB. Free memory was 52.6 MB in the beginning and 61.4 MB in the end (delta: -8.8 MB). Peak memory consumption was 6.3 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 01:30:45,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:30:45,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:30:45,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:30:45,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:30:45,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:30:45,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:30:45,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:30:45,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:30:45,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:30:45,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:30:45,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:30:45,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:30:45,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:30:45,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:30:45,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:30:45,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:30:45,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:30:45,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:30:45,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:30:45,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:30:45,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:30:45,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:30:45,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:30:45,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:30:45,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:30:45,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:30:45,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:30:45,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:30:45,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:30:45,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:30:45,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:30:45,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:30:45,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:30:45,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:30:45,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:30:45,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:30:45,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:30:45,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:30:45,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:30:45,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:30:45,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-11-30 01:30:45,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:30:45,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:30:45,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:30:45,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:30:45,782 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:30:45,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:30:45,783 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:30:45,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:30:45,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:30:45,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:30:45,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:30:45,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:30:45,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:30:45,786 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:30:45,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:30:45,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:30:45,787 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:30:45,787 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:30:45,788 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:30:45,788 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:30:45,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:30:45,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:30:45,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:30:45,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:30:45,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:30:45,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:30:45,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:30:45,790 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:30:45,802 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:30:45,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:30:45,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:30:45,803 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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 -> b099a717aded091d5866869f3c84b7af6ed3ff48 [2020-11-30 01:30:46,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:30:46,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:30:46,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:30:46,373 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:30:46,374 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:30:46,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2020-11-30 01:30:46,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/9f7c7843b/f19af50c83af42329f3fcbb75fb8b290/FLAG09b57f157 [2020-11-30 01:30:47,308 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:30:47,309 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2020-11-30 01:30:47,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/9f7c7843b/f19af50c83af42329f3fcbb75fb8b290/FLAG09b57f157 [2020-11-30 01:30:47,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/bin/uautomizer/data/9f7c7843b/f19af50c83af42329f3fcbb75fb8b290 [2020-11-30 01:30:47,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:30:47,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:30:47,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:30:47,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:30:47,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:30:47,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:30:47" (1/1) ... [2020-11-30 01:30:47,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdadb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:47, skipping insertion in model container [2020-11-30 01:30:47,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:30:47" (1/1) ... [2020-11-30 01:30:47,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:30:47,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:30:48,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:30:48,219 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-11-30 01:30:48,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:30:48,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:30:48,320 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:30:48,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:30:48,535 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:30:48,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48 WrapperNode [2020-11-30 01:30:48,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:30:48,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:30:48,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:30:48,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:30:48,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... [2020-11-30 01:30:48,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:30:48,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:30:48,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:30:48,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:30:48,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:30:48,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 01:30:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-11-30 01:30:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-11-30 01:30:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-11-30 01:30:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-11-30 01:30:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-11-30 01:30:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 01:30:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-11-30 01:30:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-30 01:30:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-11-30 01:30:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 01:30:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 01:30:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 01:30:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 01:30:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 01:30:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 01:30:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 01:30:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 01:30:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 01:30:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 01:30:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 01:30:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 01:30:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 01:30:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 01:30:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 01:30:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 01:30:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 01:30:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-11-30 01:30:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-11-30 01:30:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-11-30 01:30:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-11-30 01:30:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-11-30 01:30:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-11-30 01:30:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-11-30 01:30:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-11-30 01:30:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-11-30 01:30:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-11-30 01:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-11-30 01:30:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-11-30 01:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-11-30 01:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-11-30 01:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-11-30 01:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-11-30 01:30:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-11-30 01:30:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-11-30 01:30:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-11-30 01:30:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-11-30 01:30:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-11-30 01:30:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-11-30 01:30:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2020-11-30 01:30:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2020-11-30 01:30:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2020-11-30 01:30:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 01:30:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:30:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:30:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-11-30 01:30:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-11-30 01:30:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-11-30 01:30:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-11-30 01:30:49,572 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 01:30:50,245 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 01:30:50,895 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:30:50,896 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-30 01:30:50,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:30:50 BoogieIcfgContainer [2020-11-30 01:30:50,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:30:50,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:30:50,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:30:50,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:30:50,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:30:47" (1/3) ... [2020-11-30 01:30:50,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2424e340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:30:50, skipping insertion in model container [2020-11-30 01:30:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:30:48" (2/3) ... [2020-11-30 01:30:50,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2424e340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:30:50, skipping insertion in model container [2020-11-30 01:30:50,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:30:50" (3/3) ... [2020-11-30 01:30:50,914 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test7-1.i [2020-11-30 01:30:50,929 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:30:50,937 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 76 error locations. [2020-11-30 01:30:50,952 INFO L253 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2020-11-30 01:30:50,991 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:30:50,992 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:30:50,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:30:50,993 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:30:50,993 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:30:50,993 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:30:50,994 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:30:50,994 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:30:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2020-11-30 01:30:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:30:51,033 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:51,035 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 01:30:51,036 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, 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 01:30:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 436226143, now seen corresponding path program 1 times [2020-11-30 01:30:51,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:30:51,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219531262] [2020-11-30 01:30:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:30:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:51,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:30:51,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:51,634 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 01:30:51,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:30:51,753 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 01:30:51,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219531262] [2020-11-30 01:30:51,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:51,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 01:30:51,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153006342] [2020-11-30 01:30:51,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:30:51,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:30:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:30:51,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:51,795 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 5 states. [2020-11-30 01:30:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:51,875 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-11-30 01:30:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:30:51,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-30 01:30:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:51,890 INFO L225 Difference]: With dead ends: 53 [2020-11-30 01:30:51,890 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 01:30:51,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 01:30:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-11-30 01:30:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 01:30:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-11-30 01:30:51,949 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2020-11-30 01:30:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:51,951 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-11-30 01:30:51,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:30:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-11-30 01:30:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:30:51,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:51,955 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 01:30:52,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:30:52,167 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, 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 01:30:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 638108999, now seen corresponding path program 1 times [2020-11-30 01:30:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:30:52,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583243072] [2020-11-30 01:30:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:30:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:52,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:30:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:52,795 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 01:30:52,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:30:53,012 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 01:30:53,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583243072] [2020-11-30 01:30:53,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:53,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2020-11-30 01:30:53,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340854758] [2020-11-30 01:30:53,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:30:53,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:30:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:30:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:30:53,017 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2020-11-30 01:30:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:53,557 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2020-11-30 01:30:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:30:53,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-30 01:30:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:53,561 INFO L225 Difference]: With dead ends: 85 [2020-11-30 01:30:53,561 INFO L226 Difference]: Without dead ends: 85 [2020-11-30 01:30:53,562 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 01:30:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-30 01:30:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2020-11-30 01:30:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-30 01:30:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-11-30 01:30:53,590 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 24 [2020-11-30 01:30:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:53,592 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-11-30 01:30:53,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:30:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-11-30 01:30:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:30:53,596 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:53,597 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 01:30:53,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:30:53,813 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, 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 01:30:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1693457055, now seen corresponding path program 1 times [2020-11-30 01:30:53,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:30:53,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154055841] [2020-11-30 01:30:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:30:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:54,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:30:54,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:54,158 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 01:30:54,159 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:30:54,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:30:54,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:30:54,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:30:54,241 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 01:30:54,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:30:54,345 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 01:30:54,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154055841] [2020-11-30 01:30:54,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:54,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2020-11-30 01:30:54,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546718674] [2020-11-30 01:30:54,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:30:54,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:30:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:30:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:30:54,348 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2020-11-30 01:30:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:54,659 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2020-11-30 01:30:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:30:54,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-30 01:30:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:54,667 INFO L225 Difference]: With dead ends: 77 [2020-11-30 01:30:54,667 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 01:30:54,668 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 01:30:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 01:30:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2020-11-30 01:30:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-30 01:30:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2020-11-30 01:30:54,704 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 25 [2020-11-30 01:30:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:54,706 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2020-11-30 01:30:54,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:30:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-11-30 01:30:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:30:54,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:54,710 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 01:30:54,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:30:54,926 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, 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 01:30:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2073787341, now seen corresponding path program 1 times [2020-11-30 01:30:54,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:30:54,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640630975] [2020-11-30 01:30:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:30:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:55,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:30:55,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:57,315 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 01:30:57,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:31:07,890 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:07,903 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 01:31:07,934 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:07,977 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:08,025 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:08,094 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:08,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,177 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,188 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 01:31:08,203 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 01:31:08,252 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 01:31:08,308 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 01:31:08,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,399 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 01:31:08,405 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 01:31:08,480 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,494 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 01:31:08,499 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 01:31:08,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 01:31:08,588 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_4, v_prenex_6], 5=[v_prenex_3]} [2020-11-30 01:31:08,593 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 01:31:08,655 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2020-11-30 01:31:08,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_16| (_ BitVec 32))) (or (exists ((|v_entry_point_~#a7~0.base_13| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_13|) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_4| (store |c_old(#valid)| |v_entry_point_~#a7~0.base_13| (_ bv0 1)))))) (not (= (select |c_#valid| |v_entry_point_~#a7~0.base_16|) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_4| (store |c_#valid| |v_entry_point_~#a7~0.base_16| (_ bv0 1))))) is different from false [2020-11-30 01:31:08,690 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 01:31:08,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640630975] [2020-11-30 01:31:08,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:08,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 8] imperfect sequences [] total 10 [2020-11-30 01:31:08,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532790324] [2020-11-30 01:31:08,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:31:08,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:31:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:31:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=27, Unknown=17, NotChecked=42, Total=110 [2020-11-30 01:31:08,693 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 11 states. [2020-11-30 01:31:18,872 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 01:31:18,883 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 01:31:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:40,569 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2020-11-30 01:31:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:31:40,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-30 01:31:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:40,571 INFO L225 Difference]: With dead ends: 71 [2020-11-30 01:31:40,572 INFO L226 Difference]: Without dead ends: 62 [2020-11-30 01:31:40,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=28, Invalid=29, Unknown=19, NotChecked=80, Total=156 [2020-11-30 01:31:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-30 01:31:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-30 01:31:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-30 01:31:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2020-11-30 01:31:40,581 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2020-11-30 01:31:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:40,582 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2020-11-30 01:31:40,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:31:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2020-11-30 01:31:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:31:40,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:40,583 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 01:31:40,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:31:40,807 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, 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 01:31:40,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2095951616, now seen corresponding path program 1 times [2020-11-30 01:31:40,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:31:40,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296799510] [2020-11-30 01:31:40,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:31:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:40,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:31:40,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:41,042 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 01:31:41,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:31:41,092 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 01:31:41,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296799510] [2020-11-30 01:31:41,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:41,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 01:31:41,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042761121] [2020-11-30 01:31:41,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:41,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:31:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:41,094 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 5 states. [2020-11-30 01:31:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:41,130 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-11-30 01:31:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:41,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-11-30 01:31:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:41,134 INFO L225 Difference]: With dead ends: 52 [2020-11-30 01:31:41,134 INFO L226 Difference]: Without dead ends: 48 [2020-11-30 01:31:41,134 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 01:31:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-30 01:31:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-30 01:31:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-30 01:31:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-11-30 01:31:41,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 25 [2020-11-30 01:31:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:41,139 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-11-30 01:31:41,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:31:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-11-30 01:31:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:31:41,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:41,141 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 01:31:41,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:31:41,342 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, 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 01:31:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1373990059, now seen corresponding path program 1 times [2020-11-30 01:31:41,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:31:41,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238014579] [2020-11-30 01:31:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:31:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:31:41,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:41,547 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 01:31:41,548 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:31:41,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:31:41,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:31:41,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:31:41,660 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:31:41,660 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 01:31:41,661 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:31:41,695 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 01:31:41,701 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 01:31:41,701 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-11-30 01:31:41,940 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 01:31:41,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:31:44,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_16| (_ bv1 1)) c_probe1_6_~a.base) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_16|))))) is different from false [2020-11-30 01:31:50,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~a.base_BEFORE_CALL_6 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_17| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_17| (_ bv1 1)) v_probe1_6_~a.base_BEFORE_CALL_6) (_ bv1 1)) (_ bv0 1)) (exists ((|v_ldv_malloc_#t~malloc12.base_16| (_ BitVec 32))) (and (not (= (bvadd (select (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_16| (_ bv1 1)) v_probe1_6_~a.base_BEFORE_CALL_6) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_16|)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_17|) (_ bv0 1))))) is different from false [2020-11-30 01:31:52,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_16| (_ bv1 1)) |c_probe1_6_#in~a.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_16|))))) is different from false [2020-11-30 01:31:54,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_16| (_ bv1 1)) |c_entry_point_~#a7~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_16|))))) is different from false [2020-11-30 01:31:54,267 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 01:31:54,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238014579] [2020-11-30 01:31:54,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:54,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2020-11-30 01:31:54,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011969308] [2020-11-30 01:31:54,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:31:54,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:31:54,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:31:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=72, Unknown=6, NotChecked=76, Total=182 [2020-11-30 01:31:54,271 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 14 states. [2020-11-30 01:32:04,427 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2020-11-30 01:32:39,288 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 01:32:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:47,910 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-11-30 01:32:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:32:47,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-11-30 01:32:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:47,912 INFO L225 Difference]: With dead ends: 56 [2020-11-30 01:32:47,912 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 01:32:47,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=60, Invalid=185, Unknown=11, NotChecked=124, Total=380 [2020-11-30 01:32:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 01:32:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-11-30 01:32:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 01:32:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-11-30 01:32:47,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2020-11-30 01:32:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:47,920 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-11-30 01:32:47,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:32:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-11-30 01:32:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:32:47,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:47,921 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 01:32:48,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:32:48,127 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, 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 01:32:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1373990058, now seen corresponding path program 1 times [2020-11-30 01:32:48,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:32:48,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293722408] [2020-11-30 01:32:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:32:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:48,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 01:32:48,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:48,307 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 01:32:48,307 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:32:48,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:48,319 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 01:32:48,319 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:32:48,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:48,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:32:48,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 01:32:50,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:32:50,523 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 01:32:50,524 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:32:50,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:50,558 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:50,558 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 01:32:50,559 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:32:50,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:50,583 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 01:32:50,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2020-11-30 01:32:50,774 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 01:32:50,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:32:50,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:32:53,647 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 01:32:53,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:32:53,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:32:53,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:32:53,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:32:53,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:33:02,387 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-11-30 01:33:02,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:33:04,473 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ldv_malloc_~size (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_21| (_ 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 (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_21| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1))) (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_20| v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0))))) (or (forall ((|v_ldv_malloc_#t~malloc12.base_21| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1)))) (exists ((v_prenex_11 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11))))) is different from true [2020-11-30 01:33:04,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-11-30 01:33:06,521 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ldv_malloc_~size (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_21| (_ 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 (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_21| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1))) (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_20| v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0))))) (or (exists ((v_prenex_11 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11))) (forall ((v_prenex_12 (_ BitVec 32))) (not (= (select |c_#valid| v_prenex_12) (_ bv0 1)))))) is different from true [2020-11-30 01:33:14,872 WARN L193 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 01:33:16,906 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (or (bvule (bvadd |c_entry_point_~#a7~0.offset| (_ bv4 32)) (select (store |c_#length| v_prenex_13 v_ldv_malloc_~size_31) |c_entry_point_~#a7~0.base|)) (not (= (_ bv0 1) (select |c_#valid| v_prenex_13))))) (or (forall ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_20|)))) (bvule |c_entry_point_~#a7~0.offset| (bvadd |c_entry_point_~#a7~0.offset| (_ bv4 32))))) is different from false [2020-11-30 01:33:16,927 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 01:33:16,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293722408] [2020-11-30 01:33:16,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:16,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2020-11-30 01:33:16,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466930958] [2020-11-30 01:33:16,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:33:16,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:33:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:33:16,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=121, Unknown=8, NotChecked=72, Total=240 [2020-11-30 01:33:16,930 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 16 states. [2020-11-30 01:34:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:34:07,112 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-11-30 01:34:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:34:07,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2020-11-30 01:34:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:34:07,114 INFO L225 Difference]: With dead ends: 48 [2020-11-30 01:34:07,114 INFO L226 Difference]: Without dead ends: 48 [2020-11-30 01:34:07,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=12, NotChecked=108, Total=462 [2020-11-30 01:34:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-30 01:34:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-11-30 01:34:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-30 01:34:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-11-30 01:34:07,121 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 29 [2020-11-30 01:34:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:34:07,121 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-11-30 01:34:07,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:34:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-11-30 01:34:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 01:34:07,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:34:07,123 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 01:34:07,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:34:07,327 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, 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 01:34:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:34:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1775195694, now seen corresponding path program 1 times [2020-11-30 01:34:07,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:34:07,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294135888] [2020-11-30 01:34:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:34:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:34:07,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 01:34:07,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:34:07,642 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 01:34:07,643 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:34:07,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:34:07,646 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 01:34:07,647 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 01:34:15,876 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 01:34:15,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:34:18,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |c_#valid| |c_entry_point_~#a7~0.base| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_27 (_ 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 (not (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_27)) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_24|) (_ bv0 1))))))) is different from false [2020-11-30 01:34:18,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_30 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_probe1_6_~p~0.base_30))) (= (store (store |c_#valid| v_probe1_6_~p~0.base_30 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_probe1_6_~p~0.base_27 (_ 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 (not (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_27)) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_24|) (_ bv0 1))))))) is different from false [2020-11-30 01:34:18,882 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:18,892 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:18,910 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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 01:34:18,922 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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 01:34:18,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:18,947 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:18,970 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:18,982 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:18,999 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (= (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|) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))))))))) is different from false [2020-11-30 01:34:19,012 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (= (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|) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))))))))) is different from true [2020-11-30 01:34:19,025 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,034 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,069 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,095 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,133 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,140 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,169 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,187 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,194 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,219 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,232 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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 01:34:19,242 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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 01:34:19,339 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:19,347 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:19,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_52| (_ 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store |c_#valid| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))))))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1))))) is different from false [2020-11-30 01:34:19,452 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,477 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_20], 24=[v_prenex_18]} [2020-11-30 01:34:19,485 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 01:34:19,539 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_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (select .cse0 v_prenex_25) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))) (= (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_probe1_6_#t~ret40.base_52| (_ BitVec 32)) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14))))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30) (_ bv0 1))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse2 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (select .cse2 v_prenex_15) (_ bv0 1)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (exists ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_20)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (= v_prenex_20 (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))))))) is different from false [2020-11-30 01:34:19,607 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_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (select .cse0 v_prenex_25) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))) (= (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_probe1_6_#t~ret40.base_52| (_ BitVec 32)) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14))))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30) (_ bv0 1))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse2 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (select .cse2 v_prenex_15) (_ bv0 1)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (exists ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_20)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (= v_prenex_20 (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))))))) is different from true [2020-11-30 01:34:19,643 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,662 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_20], 24=[v_prenex_18]} [2020-11-30 01:34:19,670 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 01:34:19,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,796 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,801 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_20], 24=[v_prenex_18]} [2020-11-30 01:34:19,810 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 01:34:19,864 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_48| (_ 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 (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_48|))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (select .cse0 v_prenex_25) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))) (exists ((|v_probe1_6_#t~ret40.base_52| (_ BitVec 32)) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14))))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30) (_ bv0 1))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse2 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (select .cse2 v_prenex_15) (_ bv0 1)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ 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_48| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_20)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (= v_prenex_20 (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23)))))))))) is different from true [2020-11-30 01:34:19,917 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:34:19,953 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_20], 24=[v_prenex_18]} [2020-11-30 01:34:19,961 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 01:34:20,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:34:20,018 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2020-11-30 01:34:20,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_27| (_ BitVec 32)) (v_probe1_6_~p~0.base_30 (_ BitVec 32))) (let ((.cse0 (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))) (not (= (select .cse0 v_probe1_6_~p~0.base_30) (_ bv0 1))) (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_27| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)) (= (_ bv0 1) (select .cse1 v_probe1_6_~p~0.base_27)) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_24|) (_ bv0 1)))))))) is different from false [2020-11-30 01:34:20,094 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 01:34:20,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294135888] [2020-11-30 01:34:20,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:34:20,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2020-11-30 01:34:20,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426636536] [2020-11-30 01:34:20,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:34:20,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:34:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:34:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=116, Unknown=22, NotChecked=270, Total=462 [2020-11-30 01:34:20,099 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 22 states. [2020-11-30 01:34:35,586 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-30 01:34:35,635 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_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (select .cse0 v_prenex_25) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))) (= (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_probe1_6_#t~ret40.base_52| (_ BitVec 32)) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14))))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30) (_ bv0 1))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse2 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (select .cse2 v_prenex_15) (_ bv0 1)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (exists ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_20)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (= v_prenex_20 (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23))))))))))) is different from false [2020-11-30 01:34:35,643 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_25 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_24 (_ bv1 1)))) (and (= (select .cse0 v_prenex_25) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_prenex_25 (_ bv0 1)) v_prenex_24 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_24))))) (= (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_probe1_6_#t~ret40.base_52| (_ BitVec 32)) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (_ BitVec 32)) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_27 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_24| (_ BitVec 32))) (let ((.cse1 (store v_prenex_18 |v_entry_point_~#a7~0.base_24| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)) (= (_ bv0 1) (select v_prenex_18 |v_entry_point_~#a7~0.base_24|)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)) v_prenex_14))))) (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_14) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30) (_ bv0 1))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1)) (forall ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse2 (store v_prenex_18 v_prenex_16 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_15 (_ bv0 1)) v_prenex_16 (_ bv0 1)) v_prenex_19) (not (= (_ bv0 1) (select v_prenex_18 v_prenex_16))) (not (= (select .cse2 v_prenex_15) (_ bv0 1)))))) (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_17 (_ bv0 1)) v_prenex_19)))) (exists ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_21 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_20)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_21) (_ bv0 1)) (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_23 (_ bv1 1)))) (or (= v_prenex_20 (store (store .cse3 v_prenex_22 (_ bv0 1)) v_prenex_23 (_ bv0 1))) (not (= (select .cse3 v_prenex_22) (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_23))))))))))) is different from true [2020-11-30 01:34:35,652 WARN L838 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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))))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1))) is different from false [2020-11-30 01:34:35,658 WARN L860 $PredicateComparison]: unable to prove that (and (= (store |c_old(#valid)| |c_probe1_6_#t~ret40.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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ 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))))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1))) is different from true [2020-11-30 01:34:35,666 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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (= (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|) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1))))))))))) is different from false [2020-11-30 01:34:35,671 WARN L860 $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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (= (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|) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1))))))))))) is different from true [2020-11-30 01:34:41,744 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)))) (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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) (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))))) is different from false [2020-11-30 01:34:41,753 WARN L860 $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)))) (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|)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_16))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_30)) (not (= v_prenex_14 (store (store |c_old(#valid)| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)))) (forall ((v_probe1_6_~p~0.base_27 (_ 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 |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_24|))) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1))) (= v_prenex_14 (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_24| (_ bv0 1)))))))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) (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))))) is different from true [2020-11-30 01:35:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:35:02,269 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2020-11-30 01:35:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:35:02,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2020-11-30 01:35:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:35:02,271 INFO L225 Difference]: With dead ends: 71 [2020-11-30 01:35:02,271 INFO L226 Difference]: Without dead ends: 55 [2020-11-30 01:35:02,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 13 IntricatePredicates, 2 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=113, Invalid=266, Unknown=53, NotChecked=624, Total=1056 [2020-11-30 01:35:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-30 01:35:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2020-11-30 01:35:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-30 01:35:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-11-30 01:35:02,277 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2020-11-30 01:35:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:35:02,280 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-11-30 01:35:02,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:35:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-11-30 01:35:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 01:35:02,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:35:02,282 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 01:35:02,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:35:02,496 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, 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 01:35:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:35:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1541583040, now seen corresponding path program 1 times [2020-11-30 01:35:02,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:35:02,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2898986] [2020-11-30 01:35:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:35:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:35:02,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:35:02,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:35:02,743 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 01:35:02,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:35:02,870 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 01:35:02,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2898986] [2020-11-30 01:35:02,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:35:02,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 01:35:02,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864183525] [2020-11-30 01:35:02,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:35:02,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:35:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:35:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:35:02,872 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 5 states. [2020-11-30 01:35:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:35:02,893 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-11-30 01:35:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:35:02,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-30 01:35:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:35:02,895 INFO L225 Difference]: With dead ends: 53 [2020-11-30 01:35:02,895 INFO L226 Difference]: Without dead ends: 53 [2020-11-30 01:35:02,896 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 01:35:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-30 01:35:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-30 01:35:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 01:35:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-11-30 01:35:02,913 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 38 [2020-11-30 01:35:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:35:02,914 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-11-30 01:35:02,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:35:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-11-30 01:35:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 01:35:02,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:35:02,917 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 01:35:03,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:35:03,119 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, 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 01:35:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:35:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash 814024397, now seen corresponding path program 1 times [2020-11-30 01:35:03,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:35:03,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73981808] [2020-11-30 01:35:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:35:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:35:03,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 01:35:03,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:35:03,459 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 01:35:03,461 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:35:03,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:35:03,464 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 01:35:03,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 01:35:03,513 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 01:35:03,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:35:03,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:35:03,516 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 01:35:03,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-11-30 01:35:11,730 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 01:35:11,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:35:12,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_20| |c_#valid|) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)))) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))))))) is different from false [2020-11-30 01:35:21,480 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-30 01:35:21,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_46 (_ BitVec 32))) (or (not (= (select |c_#valid| v_probe1_6_~p~0.base_46) (_ bv0 1))) (= (store (store |c_#valid| v_probe1_6_~p~0.base_46 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)))) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))))))) is different from false [2020-11-30 01:35:22,653 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,665 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,696 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_8| (_ BitVec 32))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) is different from false [2020-11-30 01:35:22,703 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_8| (_ BitVec 32))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) is different from true [2020-11-30 01:35:22,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,720 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,740 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,758 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_8| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) is different from false [2020-11-30 01:35:22,807 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_8| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) is different from true [2020-11-30 01:35:22,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,823 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,838 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,843 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,863 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,878 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,883 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,907 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,936 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,950 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,955 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,979 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:22,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:22,999 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:23,013 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:23,018 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:23,038 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_8| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) is different from false [2020-11-30 01:35:23,046 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_8| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) is different from true [2020-11-30 01:35:23,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:23,139 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:23,184 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_8| (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (or (= (store (store |c_#valid| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |c_#valid| |v_probe1_6_#t~ret40.base_77|))) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) is different from true [2020-11-30 01:35:23,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,242 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,245 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_30, v_prenex_33], 24=[v_prenex_29]} [2020-11-30 01:35:23,256 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 01:35:23,301 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_8| (_ BitVec 32))) (or (exists ((v_prenex_32 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_32) (_ bv0 1)) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_32 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (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 (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35) (_ bv0 1))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_31 (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)) (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_26) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store v_prenex_29 |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (= (select v_prenex_29 |v_entry_point_~#a7~0.base_38|) (_ bv0 1)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26))))) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46) (_ bv0 1))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select v_prenex_29 v_prenex_28) (_ bv0 1))) (not (= (select .cse2 v_prenex_27) (_ bv0 1)))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1)))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse3 v_prenex_36) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))))) is different from false [2020-11-30 01:35:23,317 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_8| (_ BitVec 32))) (or (exists ((v_prenex_32 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_32) (_ bv0 1)) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_32 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (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 (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35) (_ bv0 1))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_31 (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)) (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_26) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store v_prenex_29 |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (= (select v_prenex_29 |v_entry_point_~#a7~0.base_38|) (_ bv0 1)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26))))) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46) (_ bv0 1))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select v_prenex_29 v_prenex_28) (_ bv0 1))) (not (= (select .cse2 v_prenex_27) (_ bv0 1)))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1)))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse3 v_prenex_36) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))))) is different from true [2020-11-30 01:35:23,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,383 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,386 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_30, v_prenex_33], 24=[v_prenex_29]} [2020-11-30 01:35:23,396 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 01:35:23,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,511 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,515 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_30, v_prenex_33], 24=[v_prenex_29]} [2020-11-30 01:35:23,524 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 01:35:23,569 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_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_prenex_32 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_32) (_ bv0 1)) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_32 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (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 (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35) (_ bv0 1))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (exists ((v_prenex_31 (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)) (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_26) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store v_prenex_29 |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (= (select v_prenex_29 |v_entry_point_~#a7~0.base_38|) (_ bv0 1)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26))))) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46) (_ bv0 1))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select v_prenex_29 v_prenex_28) (_ bv0 1))) (not (= (select .cse2 v_prenex_27) (_ bv0 1)))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse3 v_prenex_36) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) is different from false [2020-11-30 01:35:23,643 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_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_24| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_prenex_32 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_32) (_ bv0 1)) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_32 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (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 (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35) (_ bv0 1))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (exists ((v_prenex_31 (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)) (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_26) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store v_prenex_29 |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (= (select v_prenex_29 |v_entry_point_~#a7~0.base_38|) (_ bv0 1)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26))))) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46) (_ bv0 1))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select v_prenex_29 v_prenex_28) (_ bv0 1))) (not (= (select .cse2 v_prenex_27) (_ bv0 1)))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse3 v_prenex_36) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) is different from true [2020-11-30 01:35:23,720 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-11-30 01:35:23,737 INFO L441 ElimStorePlain]: Different costs {0=[v_prenex_30, v_prenex_33], 24=[v_prenex_29]} [2020-11-30 01:35:23,747 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 01:35:23,798 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-11-30 01:35:23,803 INFO L441 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2020-11-30 01:35:23,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_41| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (v_probe1_6_~p~0.base_46 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_entry_point_~#a7~0.base_41| (_ bv1 1)))) (or (not (= (select .cse0 v_probe1_6_~p~0.base_46) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_entry_point_~#a7~0.base_41|))) (= (store (store .cse0 v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_41| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)))) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_38|) (_ bv0 1)))))))) is different from false [2020-11-30 01:35:23,890 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 01:35:23,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73981808] [2020-11-30 01:35:23,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:35:23,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 13] imperfect sequences [] total 21 [2020-11-30 01:35:23,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019750653] [2020-11-30 01:35:23,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:35:23,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:35:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:35:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=115, Unknown=23, NotChecked=270, Total=462 [2020-11-30 01:35:23,895 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2020-11-30 01:35:44,835 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_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (or (= (store (store |c_#valid| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (_ bv0 1) (select |c_#valid| |v_probe1_6_#t~ret40.base_77|))) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) (= |c_old(#valid)| |c_#valid|)) is different from false [2020-11-30 01:35:45,561 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_8| (_ BitVec 32))) (or (exists ((v_prenex_32 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_32) (_ bv0 1)) (not (= v_prenex_33 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_32 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (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 (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_35) (_ bv0 1))) (= (store (store .cse0 v_prenex_34 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_prenex_31 (_ BitVec 32)) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_30)) (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) v_prenex_31 (_ bv0 1)) v_prenex_26) (exists ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse1 (store v_prenex_29 |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (and (= (select .cse1 v_probe1_6_~p~0.base_43) (_ bv0 1)) (= (select v_prenex_29 |v_entry_point_~#a7~0.base_38|) (_ bv0 1)) (not (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26))))) (not (= (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46) (_ bv0 1))))) (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse2 (store v_prenex_29 v_prenex_28 (_ bv1 1)))) (or (= (store (store .cse2 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)) v_prenex_30) (not (= (select v_prenex_29 v_prenex_28) (_ bv0 1))) (not (= (select .cse2 v_prenex_27) (_ bv0 1)))))) (= (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1)))) (exists ((v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_37 (_ bv1 1)))) (and (= (select .cse3 v_prenex_36) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_37) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse3 v_prenex_36 (_ bv0 1)) v_prenex_37 (_ bv0 1))))))))) (= |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 01:35:45,576 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_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) (= (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))) is different from false [2020-11-30 01:35:45,580 WARN L860 $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_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (= (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))))) (= (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))) is different from true [2020-11-30 01:35:45,586 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_8| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|)) is different from false [2020-11-30 01:35:45,592 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_8| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1))))) (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) (= (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)) |c_#valid|)) is different from true [2020-11-30 01:35:59,989 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_8| (_ BitVec 32))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1)))))))) is different from false [2020-11-30 01:36:00,015 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_8| (_ BitVec 32))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_probe1_6_~p~0.base_43 (_ BitVec 32)) (|v_entry_point_~#a7~0.base_38| (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (select .cse0 v_probe1_6_~p~0.base_43) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) v_prenex_26)))) (not (= (store (store |c_old(#valid)| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_26)) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)))) (exists ((v_prenex_27 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_28 (_ bv1 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_28 (_ bv0 1)))) (= (select .cse1 v_prenex_27) (_ bv0 1)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_28) (_ bv0 1)))))))) is different from true [2020-11-30 01:36:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:30,908 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-11-30 01:36:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:36:30,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-11-30 01:36:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:30,909 INFO L225 Difference]: With dead ends: 58 [2020-11-30 01:36:30,910 INFO L226 Difference]: Without dead ends: 43 [2020-11-30 01:36:30,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=111, Invalid=253, Unknown=72, NotChecked=686, Total=1122 [2020-11-30 01:36:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-30 01:36:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-30 01:36:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-30 01:36:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2020-11-30 01:36:30,915 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 39 [2020-11-30 01:36:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:30,916 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2020-11-30 01:36:30,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:36:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-11-30 01:36:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 01:36:30,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:30,917 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] [2020-11-30 01:36:31,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:36:31,129 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, 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 01:36:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1897000381, now seen corresponding path program 1 times [2020-11-30 01:36:31,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:36:31,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107544020] [2020-11-30 01:36:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_268ce21e-5388-453a-85c1-7f4a2c0cfa02/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 01:36:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:36:31,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:36:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:36:31,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:36:31,481 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-30 01:36:31,481 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:36:31,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 01:36:31,710 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-11-30 01:36:31,717 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 9bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-11-30 01:36:31,717 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-11-30 01:36:31,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:36:31 BoogieIcfgContainer [2020-11-30 01:36:31,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:36:31,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:36:31,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:36:31,733 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:36:31,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:30:50" (3/4) ... [2020-11-30 01:36:31,737 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:36:31,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:36:31,742 INFO L168 Benchmark]: Toolchain (without parser) took 344252.72 ms. Allocated memory was 67.1 MB in the beginning and 130.0 MB in the end (delta: 62.9 MB). Free memory was 49.2 MB in the beginning and 73.5 MB in the end (delta: -24.2 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:31,745 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 67.1 MB. Free memory is still 50.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:36:31,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.73 ms. Allocated memory is still 67.1 MB. Free memory was 49.0 MB in the beginning and 42.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:31,746 INFO L168 Benchmark]: Boogie Preprocessor took 146.74 ms. Allocated memory is still 67.1 MB. Free memory was 42.5 MB in the beginning and 37.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:31,746 INFO L168 Benchmark]: RCFGBuilder took 2217.17 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 37.8 MB in the beginning and 65.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:31,747 INFO L168 Benchmark]: TraceAbstraction took 340825.94 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 65.2 MB in the beginning and 73.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 34.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:31,748 INFO L168 Benchmark]: Witness Printer took 4.68 ms. Allocated memory is still 130.0 MB. Free memory is still 73.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:36:31,753 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.41 ms. Allocated memory is still 67.1 MB. Free memory is still 50.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1045.73 ms. Allocated memory is still 67.1 MB. Free memory was 49.0 MB in the beginning and 42.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 146.74 ms. Allocated memory is still 67.1 MB. Free memory was 42.5 MB in the beginning and 37.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2217.17 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 37.8 MB in the beginning and 65.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 340825.94 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 65.2 MB in the beginning and 73.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 34.4 MB. Max. memory is 16.1 GB. * Witness Printer took 4.68 ms. Allocated memory is still 130.0 MB. Free memory is still 73.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 9bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 5bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 789]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 789. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={3:0}] [L790] CALL entry_point() VAL [ldv_global_msg_list={3:0}] [L783] struct A a7; VAL [a7={7:0}, ldv_global_msg_list={3:0}] [L784] CALL, EXPR probe1_6(&a7) VAL [a={7:0}, ldv_global_msg_list={3:0}] [L764] int ret = - -3; VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={3:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [\old(size)=4, \result={1:0}, ldv_global_msg_list={3:0}, malloc(size)={1:0}, size=4] [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, ldv_malloc(sizeof(int))={1:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, p={1:0}, ret=3] [L768] CALL, EXPR f6() VAL [ldv_global_msg_list={3:0}] [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() VAL [a={7:0}, a={7:0}, f6()=0, ldv_global_msg_list={3:0}, p={1:0}, ret=3] [L768] ret = f6() [L769] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, p={1:0}, ret=0] [L771] CALL, EXPR g6() VAL [ldv_global_msg_list={3:0}] [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() VAL [a={7:0}, a={7:0}, g6()=0, ldv_global_msg_list={3:0}, p={1:0}, ret=0] [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, p={1:0}, ret=0] [L774] a->p = p VAL [a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, p={1:0}, ret=0] [L775] return 0; VAL [\result=0, a={7:0}, a={7:0}, ldv_global_msg_list={3:0}, p={1:0}, ret=0] [L784] RET, EXPR probe1_6(&a7) VAL [a7={7:0}, ldv_global_msg_list={3:0}, probe1_6(&a7)=0] [L784] int ret = probe1_6(&a7); [L785] COND TRUE ret==0 VAL [a7={7:0}, ldv_global_msg_list={3:0}, ret=0] [L786] FCALL disconnect_2_6(&a7) VAL [a7={7:0}, ldv_global_msg_list={3:0}, ret=0] [L790] RET entry_point() VAL [ldv_global_msg_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 364 locations, 76 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 340.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 245.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 449 SDtfs, 369 SDslu, 1287 SDs, 0 SdLazy, 965 SolverSat, 132 SolverUnsat, 108 SolverUnknown, 0 SolverNotchecked, 171.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 467 SyntacticMatches, 20 SemanticMatches, 133 ConstructedPredicates, 39 IntricatePredicates, 3 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 157.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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, 10 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 89.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 558 ConstructedInterpolants, 142 QuantifiedInterpolants, 252593 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...