./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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.1.25-f470102 [2019-12-07 12:27:57,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:27:57,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:27:57,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:27:57,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:27:57,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:27:57,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:27:57,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:27:57,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:27:57,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:27:57,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:27:57,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:27:57,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:27:57,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:27:57,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:27:57,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:27:57,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:27:57,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:27:57,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:27:57,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:27:57,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:27:57,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:27:57,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:27:57,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:27:57,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:27:57,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:27:57,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:27:57,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:27:57,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:27:57,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:27:57,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:27:57,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:27:57,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:27:57,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:27:57,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:27:57,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:27:57,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:27:57,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:27:57,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:27:57,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:27:57,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:27:57,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 12:27:57,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:27:57,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:27:57,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:27:57,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:27:57,710 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:27:57,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:27:57,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:27:57,710 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:27:57,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:27:57,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:27:57,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:27:57,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:27:57,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:27:57,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:27:57,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:27:57,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:27:57,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:27:57,824 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:27:57,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2019-12-07 12:27:57,861 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/a875d2d13/8f1a2878c49f4fdda2cef7be1e356d49/FLAG95dd0feab [2019-12-07 12:27:58,369 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:27:58,370 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2019-12-07 12:27:58,381 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/a875d2d13/8f1a2878c49f4fdda2cef7be1e356d49/FLAG95dd0feab [2019-12-07 12:27:58,895 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/a875d2d13/8f1a2878c49f4fdda2cef7be1e356d49 [2019-12-07 12:27:58,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:27:58,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:27:58,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:58,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:27:58,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:27:58,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:58" (1/1) ... [2019-12-07 12:27:58,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e799b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:58, skipping insertion in model container [2019-12-07 12:27:58,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:58" (1/1) ... [2019-12-07 12:27:58,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:27:58,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:27:59,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:27:59,204 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) [2019-12-07 12:27:59,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30a77b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:59, skipping insertion in model container [2019-12-07 12:27:59,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:59,204 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 12:27:59,206 INFO L168 Benchmark]: Toolchain (without parser) took 307.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:59,207 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:27:59,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:59,208 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 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.1.25-f470102 [2019-12-07 12:28:00,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:28:00,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:28:00,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:28:00,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:28:00,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:28:00,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:28:00,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:28:00,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:28:00,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:28:00,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:28:00,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:28:00,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:28:00,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:28:00,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:28:00,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:28:00,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:28:00,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:28:00,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:28:00,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:28:00,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:28:00,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:28:00,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:28:00,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:28:00,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:28:00,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:28:00,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:28:00,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:28:00,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:28:00,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:28:00,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:28:00,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:28:00,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:28:00,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:28:00,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:28:00,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:28:00,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:28:00,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:28:00,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:28:00,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:28:00,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:28:00,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 12:28:00,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:28:00,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:28:00,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:28:00,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:28:00,369 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:28:00,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:28:00,370 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:28:00,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:28:00,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:28:00,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:28:00,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:28:00,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:28:00,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:28:00,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:28:00,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:28:00,373 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:28:00,373 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:28:00,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:28:00,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:28:00,373 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:00,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:28:00,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:28:00,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:28:00,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:28:00,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:28:00,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2019-12-07 12:28:00,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/671f31386/5777b16231e64135b36c911b434b4e8f/FLAGf963add04 [2019-12-07 12:28:01,063 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:28:01,064 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/sv-benchmarks/c/ldv-memsafety/memleaks_test7-1.i [2019-12-07 12:28:01,074 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/671f31386/5777b16231e64135b36c911b434b4e8f/FLAGf963add04 [2019-12-07 12:28:01,388 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/data/671f31386/5777b16231e64135b36c911b434b4e8f [2019-12-07 12:28:01,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:28:01,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 12:28:01,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:28:01,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:28:01,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:28:01,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ab5c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01, skipping insertion in model container [2019-12-07 12:28:01,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:28:01,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:28:01,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:28:01,737 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 12:28:01,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:28:01,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:28:01,781 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:28:01,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:28:01,868 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:28:01,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01 WrapperNode [2019-12-07 12:28:01,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:28:01,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:28:01,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:28:01,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:28:01,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... [2019-12-07 12:28:01,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:28:01,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:28:01,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:28:01,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:28:01,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:28:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 12:28:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 12:28:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 12:28:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 12:28:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 12:28:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 12:28:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 12:28:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 12:28:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 12:28:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 12:28:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 12:28:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 12:28:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 12:28:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 12:28:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 12:28:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 12:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 12:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 12:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 12:28:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 12:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 12:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 12:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2019-12-07 12:28:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 12:28:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 12:28:02,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 12:28:02,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 12:28:02,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 12:28:02,389 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:28:02,658 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:28:02,907 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:28:02,907 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 12:28:02,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:28:02 BoogieIcfgContainer [2019-12-07 12:28:02,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:28:02,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:28:02,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:28:02,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:28:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:28:01" (1/3) ... [2019-12-07 12:28:02,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24305d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:28:02, skipping insertion in model container [2019-12-07 12:28:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:28:01" (2/3) ... [2019-12-07 12:28:02,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24305d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:28:02, skipping insertion in model container [2019-12-07 12:28:02,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:28:02" (3/3) ... [2019-12-07 12:28:02,915 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test7-1.i [2019-12-07 12:28:02,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:28:02,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 76 error locations. [2019-12-07 12:28:02,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2019-12-07 12:28:02,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:28:02,947 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:28:02,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:28:02,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:28:02,948 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:28:02,948 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:28:02,948 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:28:02,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:28:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 12:28:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:28:02,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:02,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:02,967 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash 436226143, now seen corresponding path program 1 times [2019-12-07 12:28:02,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:02,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743010446] [2019-12-07 12:28:02,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:03,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:28:03,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:03,147 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:03,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743010446] [2019-12-07 12:28:03,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:03,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:28:03,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83968296] [2019-12-07 12:28:03,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:03,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:03,200 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 5 states. [2019-12-07 12:28:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:03,239 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-12-07 12:28:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:28:03,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 12:28:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:03,248 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:28:03,248 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:28:03,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:28:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 12:28:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:28:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 12:28:03,275 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2019-12-07 12:28:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:03,275 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 12:28:03,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 12:28:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:28:03,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:03,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:03,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:28:03,478 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:03,478 INFO L82 PathProgramCache]: Analyzing trace with hash 638108999, now seen corresponding path program 1 times [2019-12-07 12:28:03,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:03,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28913767] [2019-12-07 12:28:03,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:03,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:28:03,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:03,683 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:03,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28913767] [2019-12-07 12:28:03,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:03,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-12-07 12:28:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226266066] [2019-12-07 12:28:03,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:28:03,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:28:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:28:03,793 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2019-12-07 12:28:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:04,098 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-12-07 12:28:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:28:04,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 12:28:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:04,100 INFO L225 Difference]: With dead ends: 85 [2019-12-07 12:28:04,100 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 12:28:04,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:28:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 12:28:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-12-07 12:28:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:28:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-12-07 12:28:04,107 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 24 [2019-12-07 12:28:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:04,108 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-12-07 12:28:04,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:28:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-12-07 12:28:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:28:04,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:04,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:04,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:28:04,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1693457055, now seen corresponding path program 1 times [2019-12-07 12:28:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:04,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613995340] [2019-12-07 12:28:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:04,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:28:04,432 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:04,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:28:04,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:04,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:04,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:28:04,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:28:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:04,486 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613995340] [2019-12-07 12:28:04,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:04,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-12-07 12:28:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991820107] [2019-12-07 12:28:04,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:28:04,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:28:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:28:04,518 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2019-12-07 12:28:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:04,647 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2019-12-07 12:28:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:28:04,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 12:28:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:04,650 INFO L225 Difference]: With dead ends: 77 [2019-12-07 12:28:04,650 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 12:28:04,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:28:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 12:28:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-12-07 12:28:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:28:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-12-07 12:28:04,658 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 25 [2019-12-07 12:28:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:04,659 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-12-07 12:28:04,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:28:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-12-07 12:28:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:28:04,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:04,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:04,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:28:04,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2073787341, now seen corresponding path program 1 times [2019-12-07 12:28:04,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:04,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503497599] [2019-12-07 12:28:04,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:05,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:28:05,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:07,037 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:15,720 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) is different from false [2019-12-07 12:28:15,729 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) is different from true [2019-12-07 12:28:15,736 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,743 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,750 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,766 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 12:28:15,785 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 12:28:15,787 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1)))))))) is different from false [2019-12-07 12:28:15,802 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1)))))))) is different from true [2019-12-07 12:28:15,807 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 12:28:15,814 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 12:28:15,817 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 12:28:15,827 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 12:28:15,829 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,835 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 12:28:15,840 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, v_prenex_4], 5=[v_prenex_5]} [2019-12-07 12:28:15,842 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,848 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_4|], 5=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-12-07 12:28:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:15,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503497599] [2019-12-07 12:28:15,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:15,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 8] imperfect sequences [] total 10 [2019-12-07 12:28:15,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639199677] [2019-12-07 12:28:15,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:28:15,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:28:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=31, Unknown=22, NotChecked=30, Total=110 [2019-12-07 12:28:15,889 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 11 states. [2019-12-07 12:28:25,268 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)))))) (exists ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)))) (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 12:28:25,277 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_5| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= (store |c_old(#valid)| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|)) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_6| |v_entry_point_~#a7~0.base_BEFORE_CALL_2| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_5| v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_5| v_prenex_2) (_ bv0 1)))))) (forall ((|v_entry_point_~#a7~0.base_14| (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_5| |v_entry_point_~#a7~0.base_14|) (_ bv0 1))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_4 (store |c_#valid| v_prenex_3 (_ bv0 1))) (exists ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (_ BitVec 32))) (or (not (= (select v_prenex_5 v_prenex_8) (_ bv0 1))) (= v_prenex_6 (store v_prenex_5 v_prenex_8 (_ bv0 1))))) (not (= v_prenex_6 (store |v_old(#valid)_BEFORE_CALL_6| v_prenex_3 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (not (= v_prenex_4 (store v_prenex_5 v_prenex_7 (_ bv0 1)))) (= (select v_prenex_5 v_prenex_7) (_ bv0 1))))))))) is different from false [2019-12-07 12:28:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:51,533 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 12:28:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:28:51,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 12:28:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:51,535 INFO L225 Difference]: With dead ends: 71 [2019-12-07 12:28:51,535 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:28:51,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=31, Invalid=33, Unknown=24, NotChecked=68, Total=156 [2019-12-07 12:28:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:28:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 12:28:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:28:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-12-07 12:28:51,539 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2019-12-07 12:28:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:51,539 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-12-07 12:28:51,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:28:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-12-07 12:28:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:28:51,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:51,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:51,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:28:51,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:51,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2095951616, now seen corresponding path program 1 times [2019-12-07 12:28:51,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:51,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491533795] [2019-12-07 12:28:51,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:51,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:28:51,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:51,850 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:51,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491533795] [2019-12-07 12:28:51,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:51,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:28:51,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081740685] [2019-12-07 12:28:51,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:51,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:51,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:51,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:51,873 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 5 states. [2019-12-07 12:28:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:51,888 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-12-07 12:28:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:28:51,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 12:28:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:51,889 INFO L225 Difference]: With dead ends: 52 [2019-12-07 12:28:51,890 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 12:28:51,890 INFO L630 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 [2019-12-07 12:28:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 12:28:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 12:28:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 12:28:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-12-07 12:28:51,894 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 25 [2019-12-07 12:28:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:51,894 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-12-07 12:28:51,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-12-07 12:28:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:28:51,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:51,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:52,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:28:52,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:28:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1373990059, now seen corresponding path program 1 times [2019-12-07 12:28:52,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:28:52,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276515902] [2019-12-07 12:28:52,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:28:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:52,255 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:28:52,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:52,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:28:52,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:52,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:52,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:28:52,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:28:52,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:52,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 12:28:52,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:52,349 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 12:28:52,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:52,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 12:28:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:52,453 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:54,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276515902] [2019-12-07 12:28:54,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:54,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-12-07 12:28:54,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867881107] [2019-12-07 12:28:54,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:28:54,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:28:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:28:54,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-12-07 12:28:54,700 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 14 states. [2019-12-07 12:29:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:03,381 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-12-07 12:29:03,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:29:03,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 12:29:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:03,382 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:29:03,382 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:29:03,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2019-12-07 12:29:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:29:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-12-07 12:29:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 12:29:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-12-07 12:29:03,386 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2019-12-07 12:29:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:03,386 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-12-07 12:29:03,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:29:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-12-07 12:29:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:29:03,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:03,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:03,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:29:03,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:29:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1373990058, now seen corresponding path program 1 times [2019-12-07 12:29:03,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:29:03,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095612229] [2019-12-07 12:29:03,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:29:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:03,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 12:29:03,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:03,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:29:03,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:03,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:03,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:29:03,696 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:03,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:03,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:03,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 12:29:05,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:05,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 12:29:05,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:05,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:05,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:05,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 12:29:05,802 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:05,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:05,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:05,812 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2019-12-07 12:29:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:05,888 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:05,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:06,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:06,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:06,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:09,034 WARN L192 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 12:29:09,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:11,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095612229] [2019-12-07 12:29:11,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:11,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-12-07 12:29:11,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666074125] [2019-12-07 12:29:11,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:29:11,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:29:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:29:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2019-12-07 12:29:11,987 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 15 states. [2019-12-07 12:29:18,246 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (forall ((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 |c_#length| v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0)))))) is different from false [2019-12-07 12:29:24,365 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (forall ((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 |c_#length| v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0))))) (= (_ bv1 1) (select |c_#valid| |c_entry_point_~#a7~0.base|)) (forall ((|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)) (ldv_malloc_~size (_ BitVec 32))) (let ((.cse1 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvule .cse1 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_21| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse1)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1)))))) (= (_ bv0 32) |c_entry_point_~#a7~0.offset|) (= (bvadd (select |c_#length| |c_entry_point_~#a7~0.base|) (_ bv4294967292 32)) (_ bv0 32))) is different from false [2019-12-07 12:29:30,613 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ldv_malloc_#t~malloc12.base_20| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_20|))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (forall ((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 |c_#length| v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse0))))) (forall ((|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)) (ldv_malloc_~size (_ BitVec 32))) (let ((.cse1 (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (bvule .cse1 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_21| ldv_malloc_~size) v_probe1_6_~a.base_BEFORE_CALL_12)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_31 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvule (bvadd v_probe1_6_~a.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_31) v_probe1_6_~a.base_BEFORE_CALL_12))))) (not (bvule v_probe1_6_~a.offset_BEFORE_CALL_6 .cse1)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_21|) (_ bv0 1))))))) is different from false [2019-12-07 12:29:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:53,131 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-12-07 12:29:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:29:53,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-12-07 12:29:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:53,133 INFO L225 Difference]: With dead ends: 48 [2019-12-07 12:29:53,133 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 12:29:53,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=58, Invalid=220, Unknown=6, NotChecked=96, Total=380 [2019-12-07 12:29:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 12:29:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-12-07 12:29:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:29:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-12-07 12:29:53,136 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 29 [2019-12-07 12:29:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:53,136 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-12-07 12:29:53,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:29:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-12-07 12:29:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:29:53,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:53,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:53,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:29:53,339 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:29:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1775195694, now seen corresponding path program 1 times [2019-12-07 12:29:53,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:29:53,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864053717] [2019-12-07 12:29:53,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:29:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:53,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 12:29:53,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:53,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 12:29:53,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:53,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:53,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:29:53,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 12:30:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:01,647 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:02,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_25|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_27)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1))))))))) is different from false [2019-12-07 12:30:02,151 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_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_25|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_27)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1))))))))) is different from false [2019-12-07 12:30:02,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (not (= (_ bv0 1) (select |c_#valid| v_probe1_6_~p~0.base_30))) (exists ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_25|)) (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_27)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1))))))) (= (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|))) is different from false [2019-12-07 12:30:02,239 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)))) (or (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))))) is different from false [2019-12-07 12:30:02,243 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)))) (or (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))))) is different from true [2019-12-07 12:30:02,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,248 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from false [2019-12-07 12:30:02,258 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from true [2019-12-07 12:30:02,260 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,263 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_13 (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from false [2019-12-07 12:30:02,275 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_13 (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from true [2019-12-07 12:30:02,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,280 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,284 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,286 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,289 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,291 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,293 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,296 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,299 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,301 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,303 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,308 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (= v_prenex_13 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from false [2019-12-07 12:30:02,322 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (= v_prenex_13 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from true [2019-12-07 12:30:02,361 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,363 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (= v_prenex_13 (store (store |c_#valid| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from false [2019-12-07 12:30:02,375 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (= v_prenex_13 (store (store |c_#valid| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_52|) (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) is different from true [2019-12-07 12:30:02,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-12-07 12:30:02,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-12-07 12:30:02,413 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_11|], 24=[v_prenex_16]} [2019-12-07 12:30:02,415 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (= v_prenex_13 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) is different from false [2019-12-07 12:30:02,446 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (= v_prenex_13 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) is different from true [2019-12-07 12:30:02,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,457 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,459 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_11|], 24=[v_prenex_16]} [2019-12-07 12:30:02,461 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,476 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_11|], 24=[v_prenex_16]} [2019-12-07 12:30:02,479 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_48| (_ BitVec 32)) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |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)) v_prenex_13) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_48|) (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) is different from false [2019-12-07 12:30:02,528 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_48| (_ BitVec 32)) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |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)) v_prenex_13) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_48|) (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) is different from true [2019-12-07 12:30:02,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:30:02,537 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_11|], 24=[v_prenex_16]} [2019-12-07 12:30:02,539 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 9=[|v_old(#valid)_BEFORE_CALL_14|], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:02,541 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:30:02,543 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_13], 24=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-07 12:30:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:07,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864053717] [2019-12-07 12:30:07,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:30:07,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 14] imperfect sequences [] total 22 [2019-12-07 12:30:07,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959840912] [2019-12-07 12:30:07,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:30:07,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:30:07,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:30:07,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=110, Unknown=28, NotChecked=310, Total=506 [2019-12-07 12:30:07,717 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2019-12-07 12:30:20,324 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (= v_prenex_13 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 12:30:20,334 WARN L860 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|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_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30)) (not (= (store (store |v_old(#valid)_BEFORE_CALL_14| v_probe1_6_~p~0.base_30 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (= v_prenex_13 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))) (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_52| (_ BitVec 32))) (and (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (let ((.cse2 (store v_prenex_16 v_prenex_21 (_ bv1 1)))) (or (not (= (select v_prenex_16 v_prenex_21) (_ bv0 1))) (not (= (select .cse2 v_prenex_19) (_ bv0 1))) (= v_prenex_17 (store (store .cse2 v_prenex_19 (_ bv0 1)) v_prenex_21 (_ bv0 1)))))) (not (= v_prenex_17 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_52| (_ bv0 1)) v_prenex_18 (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_52|)) (forall ((v_prenex_22 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (or (= v_prenex_22 (store (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_20 (_ bv0 1)) v_prenex_18 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_20))) (exists ((v_prenex_23 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse3 (store v_prenex_16 v_prenex_23 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_24 (_ bv0 1)) v_prenex_23 (_ bv0 1)) v_prenex_22)) (= (select .cse3 v_prenex_24) (_ bv0 1)) (= (select v_prenex_16 v_prenex_23) (_ bv0 1))))))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2019-12-07 12:30:20,340 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (= v_prenex_13 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))))))) is different from false [2019-12-07 12:30:20,348 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_13 (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1)))) is different from false [2019-12-07 12:30:28,391 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1)))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse0 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse0 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse1 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse1 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13)))))))) is different from false [2019-12-07 12:30:30,402 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)))) (or (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_6| (_ bv0 1)) v_prenex_13) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_14 (_ bv1 1)))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_14) (_ bv0 1)) (= (select .cse0 v_prenex_15) (_ bv0 1)) (not (= (store (store .cse0 v_prenex_15 (_ bv0 1)) v_prenex_14 (_ bv0 1)) v_prenex_13))))))) (exists ((v_probe1_6_~p~0.base_30 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((|v_entry_point_~#a7~0.base_25| (_ BitVec 32)) (v_probe1_6_~p~0.base_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25| (_ bv1 1)))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| |v_entry_point_~#a7~0.base_25|) (_ bv0 1))) (= (store (store .cse1 v_probe1_6_~p~0.base_27 (_ bv0 1)) |v_entry_point_~#a7~0.base_25| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (select .cse1 v_probe1_6_~p~0.base_27) (_ bv0 1)))))) (not (= |v_old(#valid)_BEFORE_CALL_11| (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)))) (= (select |c_old(#valid)| v_probe1_6_~p~0.base_30) (_ bv0 1)))))) (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1))))) is different from false [2019-12-07 12:30:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:54,809 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 12:30:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:30:54,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-12-07 12:30:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:54,811 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:30:54,811 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:30:54,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=97, Invalid=184, Unknown=51, NotChecked=660, Total=992 [2019-12-07 12:30:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:30:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-12-07 12:30:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:30:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-12-07 12:30:54,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2019-12-07 12:30:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:54,816 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-12-07 12:30:54,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:30:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-12-07 12:30:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:30:54,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:54,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:30:55,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:30:55,018 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:30:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:55,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1541583040, now seen corresponding path program 1 times [2019-12-07 12:30:55,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:30:55,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93574461] [2019-12-07 12:30:55,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:30:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:55,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:30:55,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:55,141 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:55,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93574461] [2019-12-07 12:30:55,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:30:55,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:30:55,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287215711] [2019-12-07 12:30:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:30:55,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:30:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:30:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:30:55,181 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 5 states. [2019-12-07 12:30:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:55,188 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-12-07 12:30:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:30:55,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 12:30:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:55,190 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:30:55,190 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:30:55,190 INFO L630 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 [2019-12-07 12:30:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:30:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-12-07 12:30:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:30:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-12-07 12:30:55,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 38 [2019-12-07 12:30:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:55,194 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-12-07 12:30:55,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:30:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-12-07 12:30:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:30:55,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:55,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:30:55,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 12:30:55,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:30:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash 814024397, now seen corresponding path program 1 times [2019-12-07 12:30:55,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:30:55,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405161954] [2019-12-07 12:30:55,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:30:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:55,561 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 12:30:55,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:55,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 12:30:55,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:55,609 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 12:30:55,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 12:30:55,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:55,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 12:31:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:31:03,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:31:20,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_20| (store (store |c_#valid| v_probe1_6_~p~0.base_46 (_ bv0 1)) |c_entry_point_~#a7~0.base| (_ bv0 1))) (exists ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ 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 (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))))) (not (= (select |c_#valid| v_probe1_6_~p~0.base_46) (_ bv0 1))))) is different from false [2019-12-07 12:31:20,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))))) is different from false [2019-12-07 12:31:20,542 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))))) is different from true [2019-12-07 12:31:20,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_25) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from false [2019-12-07 12:31:20,565 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_25) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from true [2019-12-07 12:31:20,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))))) is different from false [2019-12-07 12:31:20,642 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))))) is different from true [2019-12-07 12:31:20,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from false [2019-12-07 12:31:20,693 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from true [2019-12-07 12:31:20,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2019-12-07 12:31:20,856 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6717 conjuctions. This might take some time... [2019-12-07 12:31:20,873 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 8 conjuctions. [2019-12-07 12:31:20,875 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 12:31:20,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 12:31:20,879 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_20|], 24=[v_prenex_28]} [2019-12-07 12:31:20,881 INFO L430 ElimStorePlain]: Different costs {9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 12:31:20,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from false [2019-12-07 12:31:20,906 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from true [2019-12-07 12:31:20,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,916 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[v_prenex_28]} [2019-12-07 12:31:20,918 INFO L430 ElimStorePlain]: Different costs {9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 12:31:20,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from false [2019-12-07 12:31:20,940 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) is different from true [2019-12-07 12:31:20,945 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,951 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,953 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[v_prenex_28]} [2019-12-07 12:31:20,955 INFO L430 ElimStorePlain]: Different costs {9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 12:31:20,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 v_prenex_36))) (= (store (store .cse2 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse3 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse3 v_prenex_34)) (not (= v_prenex_30 (store (store .cse3 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))))) is different from false [2019-12-07 12:31:20,980 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 v_prenex_36))) (= (store (store .cse2 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse3 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse3 v_prenex_34)) (not (= v_prenex_30 (store (store .cse3 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))))) is different from true [2019-12-07 12:31:20,982 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,987 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 12:31:20,989 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_33, |v_old(#valid)_BEFORE_CALL_20|], 24=[v_prenex_28]} [2019-12-07 12:31:20,991 INFO L430 ElimStorePlain]: Different costs {9=[|v_old(#valid)_BEFORE_CALL_24|], 24=[|v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 12:31:21,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_~#a7~0.base_41| (_ BitVec 32)) (v_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (let ((.cse0 (store |c_#valid| |v_entry_point_~#a7~0.base_41| (_ bv1 1)))) (or (= (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|) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_46))) (exists ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ 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 (= (store (store .cse1 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|)) (= (select |c_old(#valid)| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))))) (not (= (select |c_#valid| |v_entry_point_~#a7~0.base_41|) (_ bv0 1)))))) is different from false [2019-12-07 12:31:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:31:21,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405161954] [2019-12-07 12:31:21,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:21,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 14] imperfect sequences [] total 22 [2019-12-07 12:31:21,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683498518] [2019-12-07 12:31:21,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:31:21,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:31:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:31:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=121, Unknown=40, NotChecked=288, Total=506 [2019-12-07 12:31:21,095 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2019-12-07 12:31:43,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32)) (|v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_probe1_6_#t~ret40.base_77|) (_ bv0 1))) (exists ((v_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 12:31:43,829 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 v_prenex_36))) (= (store (store .cse2 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse3 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse3 v_prenex_34)) (not (= v_prenex_30 (store (store .cse3 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 12:31:43,843 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_probe1_6_~p~0.base_46 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 12:31:43,857 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_24| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46)) (not (= |v_old(#valid)_BEFORE_CALL_20| (store (store |v_old(#valid)_BEFORE_CALL_24| v_probe1_6_~p~0.base_46 (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (exists ((v_prenex_29 (_ BitVec 32)) (v_prenex_28 (Array (_ BitVec 32) (_ BitVec 1))) (|v_probe1_6_#t~ret40.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe1_6_#t~ret40.base_77|)) (exists ((v_prenex_33 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_33 (store (store |c_old(#valid)| |v_probe1_6_#t~ret40.base_77| (_ bv0 1)) v_prenex_29 (_ bv0 1)))) (forall ((v_prenex_35 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse1 (store v_prenex_28 v_prenex_35 (_ bv1 1)))) (or (not (= (select v_prenex_28 v_prenex_35) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 v_prenex_36))) (= (store (store .cse1 v_prenex_36 (_ bv0 1)) v_prenex_35 (_ bv0 1)) v_prenex_33)))))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_30 (store (store |v_old(#valid)_BEFORE_CALL_24| v_prenex_31 (_ bv0 1)) v_prenex_29 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_24| v_prenex_31))) (exists ((v_prenex_34 (_ BitVec 32)) (v_prenex_32 (_ BitVec 32))) (let ((.cse2 (store v_prenex_28 v_prenex_32 (_ bv1 1)))) (and (= (select v_prenex_28 v_prenex_32) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_prenex_34)) (not (= v_prenex_30 (store (store .cse2 v_prenex_34 (_ bv0 1)) v_prenex_32 (_ bv0 1))))))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_25 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse3 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse3 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse3 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 12:31:43,865 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_probe1_6_#t~ret40.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_probe1_6_#t~ret40.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store (store |c_#valid| |c_probe1_6_#t~ret40.base| (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)))))))) is different from false [2019-12-07 12:31:43,873 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_probe1_6_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_probe1_6_~p~0.base (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| c_probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1)) v_prenex_25) (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1)))))))))) is different from false [2019-12-07 12:31:54,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_21| (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_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= |v_old(#valid)_BEFORE_CALL_20| (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)))) (= (_ bv0 1) (select |c_old(#valid)| v_probe1_6_~p~0.base_46)) (forall ((|v_entry_point_~#a7~0.base_38| (_ BitVec 32)) (v_probe1_6_~p~0.base_43 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38| (_ bv1 1)))) (or (= (store (store .cse0 v_probe1_6_~p~0.base_43 (_ bv0 1)) |v_entry_point_~#a7~0.base_38| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_20|) (not (= (select |v_old(#valid)_BEFORE_CALL_21| |v_entry_point_~#a7~0.base_38|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_probe1_6_~p~0.base_43)))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_26 (_ bv1 1)))) (and (not (= (store (store .cse1 v_prenex_27 (_ bv0 1)) v_prenex_26 (_ bv0 1)) v_prenex_25)) (= (_ bv0 1) (select .cse1 v_prenex_27)) (= (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_26) (_ bv0 1))))) (= v_prenex_25 (store |c_#valid| |v_entry_point_~#a7~0.base_BEFORE_CALL_8| (_ bv0 1))))))) (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))) (= (select |c_old(#valid)| probe1_6_~p~0.base) (_ bv0 1))))) is different from false [2019-12-07 12:32:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:02,829 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-12-07 12:32:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:32:02,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-12-07 12:32:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:02,830 INFO L225 Difference]: With dead ends: 55 [2019-12-07 12:32:02,830 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:32:02,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=91, Invalid=185, Unknown=60, NotChecked=720, Total=1056 [2019-12-07 12:32:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:32:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 12:32:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:32:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-12-07 12:32:02,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 39 [2019-12-07 12:32:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:02,834 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-12-07 12:32:02,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:32:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-12-07 12:32:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:32:02,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:02,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:03,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:32:03,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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]=== [2019-12-07 12:32:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1897000381, now seen corresponding path program 1 times [2019-12-07 12:32:03,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:03,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550229832] [2019-12-07 12:32:03,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86790980-5bf1-47d6-a3bf-93d7e2068feb/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 [2019-12-07 12:32:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:03,230 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 12:32:03,230 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:32:03,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 12:32:03,452 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 12:32:03,455 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# [2019-12-07 12:32:03,456 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# [2019-12-07 12:32:03,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:03 BoogieIcfgContainer [2019-12-07 12:32:03,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:32:03,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:32:03,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:32:03,464 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:32:03,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:28:02" (3/4) ... [2019-12-07 12:32:03,466 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:32:03,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:32:03,467 INFO L168 Benchmark]: Toolchain (without parser) took 242073.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -120.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:03,467 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:03,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:03,468 INFO L168 Benchmark]: Boogie Preprocessor took 65.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:03,468 INFO L168 Benchmark]: RCFGBuilder took 974.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.4 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:03,468 INFO L168 Benchmark]: TraceAbstraction took 240553.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -118.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:03,469 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:03,470 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 471.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 974.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.4 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 240553.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -118.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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. Result: UNSAFE, OverallTime: 240.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 174.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 446 SDtfs, 373 SDslu, 1309 SDs, 0 SdLazy, 1004 SolverSat, 138 SolverUnsat, 92 SolverUnknown, 0 SolverNotchecked, 146.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 465 SyntacticMatches, 19 SemanticMatches, 129 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 87.6s 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 61.8s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 558 ConstructedInterpolants, 142 QuantifiedInterpolants, 253465 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, 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...