./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.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_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 0775aa74e42740d69127a88680deb3bae2149559 ............................................................................................................................ 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_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 0775aa74e42740d69127a88680deb3bae2149559 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:35:04,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:35:04,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:35:04,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:35:04,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:35:04,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:35:04,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:35:04,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:35:04,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:35:04,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:35:04,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:35:04,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:35:04,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:35:04,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:35:04,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:35:04,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:35:04,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:35:04,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:35:04,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:35:04,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:35:04,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:35:04,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:35:04,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:35:04,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:35:04,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:35:04,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:35:04,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:35:04,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:35:04,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:35:04,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:35:04,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:35:04,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:35:04,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:35:04,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:35:04,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:35:04,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:35:04,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:35:04,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:35:04,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:35:04,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:35:04,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:35:04,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:35:04,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:35:04,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:35:04,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:35:04,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:35:04,378 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:35:04,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:35:04,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:35:04,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:35:04,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:35:04,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:35:04,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:35:04,380 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:35:04,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:35:04,380 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:35:04,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:35:04,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:35:04,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:35:04,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:35:04,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:35:04,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:35:04,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:35:04,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:35:04,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:35:04,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:35:04,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:35:04,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:35:04,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:35:04,383 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:35:04,383 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_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 -> 0775aa74e42740d69127a88680deb3bae2149559 [2019-12-07 18:35:04,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:35:04,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:35:04,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:35:04,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:35:04,495 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:35:04,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-12-07 18:35:04,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/40d277a3d/2fe7c497657041ddbfbf0b81682a3652/FLAG04cdbacb6 [2019-12-07 18:35:04,916 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:35:04,917 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-12-07 18:35:04,926 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/40d277a3d/2fe7c497657041ddbfbf0b81682a3652/FLAG04cdbacb6 [2019-12-07 18:35:04,935 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/40d277a3d/2fe7c497657041ddbfbf0b81682a3652 [2019-12-07 18:35:04,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:35:04,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:35:04,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:04,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:35:04,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:35:04,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:04" (1/1) ... [2019-12-07 18:35:04,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd7fe22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:04, skipping insertion in model container [2019-12-07 18:35:04,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:04" (1/1) ... [2019-12-07 18:35:04,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:35:04,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:35:05,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:05,234 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 18:35:05,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@24f12b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:05, skipping insertion in model container [2019-12-07 18:35:05,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:05,234 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 18:35:05,236 INFO L168 Benchmark]: Toolchain (without parser) took 297.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:05,236 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:35:05,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:05,238 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 18.7 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 18:35:06,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:35:06,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:35:06,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:35:06,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:35:06,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:35:06,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:35:06,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:35:06,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:35:06,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:35:06,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:35:06,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:35:06,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:35:06,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:35:06,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:35:06,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:35:06,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:35:06,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:35:06,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:35:06,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:35:06,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:35:06,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:35:06,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:35:06,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:35:06,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:35:06,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:35:06,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:35:06,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:35:06,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:35:06,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:35:06,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:35:06,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:35:06,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:35:06,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:35:06,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:35:06,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:35:06,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:35:06,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:35:06,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:35:06,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:35:06,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:35:06,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 18:35:06,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:35:06,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:35:06,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:35:06,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:35:06,450 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:35:06,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:35:06,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:35:06,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:35:06,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:35:06,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:35:06,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:35:06,453 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:35:06,454 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:35:06,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:35:06,454 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_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 -> 0775aa74e42740d69127a88680deb3bae2149559 [2019-12-07 18:35:06,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:35:06,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:35:06,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:35:06,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:35:06,642 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:35:06,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-12-07 18:35:06,681 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/2710aea3b/ce22641dff004c76a1a59f2c56999969/FLAG0ce4b9fdc [2019-12-07 18:35:07,204 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:35:07,204 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2019-12-07 18:35:07,214 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/2710aea3b/ce22641dff004c76a1a59f2c56999969/FLAG0ce4b9fdc [2019-12-07 18:35:07,711 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/data/2710aea3b/ce22641dff004c76a1a59f2c56999969 [2019-12-07 18:35:07,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:35:07,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:35:07,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:07,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:35:07,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:35:07,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:07" (1/1) ... [2019-12-07 18:35:07,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:07, skipping insertion in model container [2019-12-07 18:35:07,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:07" (1/1) ... [2019-12-07 18:35:07,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:35:07,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:35:08,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:08,014 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 18:35:08,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:35:08,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:08,059 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:35:08,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:08,145 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:35:08,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08 WrapperNode [2019-12-07 18:35:08,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:08,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:35:08,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:35:08,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:35:08,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... [2019-12-07 18:35:08,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:35:08,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:35:08,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:35:08,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:35:08,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 18:35:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 18:35:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 18:35:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 18:35:08,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 18:35:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:35:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 18:35:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:35:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:35:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:35:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:35:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:35:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:35:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:35:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:35:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:35:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 18:35:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 18:35:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 18:35:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 18:35:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 18:35:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 18:35:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:35:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 18:35:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 18:35:08,631 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:35:08,879 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:35:09,118 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:35:09,118 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 18:35:09,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:09 BoogieIcfgContainer [2019-12-07 18:35:09,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:35:09,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:35:09,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:35:09,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:35:09,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:35:07" (1/3) ... [2019-12-07 18:35:09,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c99d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:09, skipping insertion in model container [2019-12-07 18:35:09,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:08" (2/3) ... [2019-12-07 18:35:09,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c99d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:09, skipping insertion in model container [2019-12-07 18:35:09,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:09" (3/3) ... [2019-12-07 18:35:09,124 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test4-2.i [2019-12-07 18:35:09,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:35:09,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-12-07 18:35:09,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-12-07 18:35:09,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:35:09,157 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:35:09,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:35:09,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:35:09,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:35:09,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:35:09,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:35:09,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:35:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-12-07 18:35:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:35:09,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:09,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:09,176 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2025190552, now seen corresponding path program 1 times [2019-12-07 18:35:09,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:09,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038810191] [2019-12-07 18:35:09,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:09,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:35:09,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:09,353 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 18:35:09,354 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:09,420 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 18:35:09,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038810191] [2019-12-07 18:35:09,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:09,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 18:35:09,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024258354] [2019-12-07 18:35:09,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:09,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:09,437 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 5 states. [2019-12-07 18:35:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:09,486 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-12-07 18:35:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:09,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:35:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:09,497 INFO L225 Difference]: With dead ends: 53 [2019-12-07 18:35:09,497 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 18:35:09,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 18:35:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 18:35:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-12-07 18:35:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 18:35:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-12-07 18:35:09,532 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2019-12-07 18:35:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:09,533 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 18:35:09,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-12-07 18:35:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:35:09,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:09,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:09,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:35:09,735 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:09,736 INFO L82 PathProgramCache]: Analyzing trace with hash -282380217, now seen corresponding path program 1 times [2019-12-07 18:35:09,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:09,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408403] [2019-12-07 18:35:09,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:09,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:35:09,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:09,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:09,875 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 18:35:09,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408403] [2019-12-07 18:35:09,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:09,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:35:09,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738451401] [2019-12-07 18:35:09,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:09,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:09,878 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2019-12-07 18:35:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:09,920 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-12-07 18:35:09,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:09,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:35:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:09,922 INFO L225 Difference]: With dead ends: 46 [2019-12-07 18:35:09,922 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 18:35:09,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 18:35:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-12-07 18:35:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 18:35:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-12-07 18:35:09,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 16 [2019-12-07 18:35:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:09,929 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-12-07 18:35:09,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-12-07 18:35:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:35:09,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:09,930 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:10,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:35:10,133 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2034469669, now seen corresponding path program 1 times [2019-12-07 18:35:10,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:10,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497641395] [2019-12-07 18:35:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:10,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:35:10,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:10,315 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:10,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497641395] [2019-12-07 18:35:10,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:10,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:35:10,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868009769] [2019-12-07 18:35:10,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:10,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:10,337 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2019-12-07 18:35:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:10,344 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 18:35:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:10,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 18:35:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:10,345 INFO L225 Difference]: With dead ends: 30 [2019-12-07 18:35:10,345 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 18:35:10,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 18:35:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 18:35:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 18:35:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 18:35:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-12-07 18:35:10,348 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-12-07 18:35:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:10,348 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-12-07 18:35:10,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-12-07 18:35:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:35:10,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:10,349 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:10,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:35:10,551 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1355950095, now seen corresponding path program 1 times [2019-12-07 18:35:10,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:10,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351406547] [2019-12-07 18:35:10,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:10,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:35:10,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:10,797 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:10,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351406547] [2019-12-07 18:35:10,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:10,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-12-07 18:35:10,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663813424] [2019-12-07 18:35:10,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:35:10,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:35:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:35:10,887 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-12-07 18:35:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:11,077 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-12-07 18:35:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:35:11,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 18:35:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:11,078 INFO L225 Difference]: With dead ends: 50 [2019-12-07 18:35:11,078 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 18:35:11,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:35:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 18:35:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-12-07 18:35:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 18:35:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 18:35:11,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2019-12-07 18:35:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:11,082 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 18:35:11,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:35:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 18:35:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:35:11,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:11,083 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:11,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:35:11,285 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -915219619, now seen corresponding path program 1 times [2019-12-07 18:35:11,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:11,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226266066] [2019-12-07 18:35:11,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:11,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:35:11,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:11,427 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 18:35:11,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:11,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:35:11,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:35:11,430 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:35:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:11,443 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:11,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226266066] [2019-12-07 18:35:11,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:11,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:35:11,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771014677] [2019-12-07 18:35:11,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:11,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:11,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:11,471 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2019-12-07 18:35:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:11,506 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 18:35:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:11,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:35:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:11,507 INFO L225 Difference]: With dead ends: 35 [2019-12-07 18:35:11,507 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 18:35:11,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 18:35:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 18:35:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 18:35:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 18:35:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-12-07 18:35:11,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 22 [2019-12-07 18:35:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:11,510 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-12-07 18:35:11,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-12-07 18:35:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:35:11,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:11,511 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:11,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:35:11,714 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -27715938, now seen corresponding path program 1 times [2019-12-07 18:35:11,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:11,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350174631] [2019-12-07 18:35:11,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:11,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:35:11,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:11,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:11,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350174631] [2019-12-07 18:35:11,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:11,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:35:11,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290853585] [2019-12-07 18:35:11,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:11,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:11,860 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2019-12-07 18:35:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:11,874 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 18:35:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:11,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:35:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:11,875 INFO L225 Difference]: With dead ends: 42 [2019-12-07 18:35:11,875 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 18:35:11,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 18:35:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 18:35:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-12-07 18:35:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 18:35:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-12-07 18:35:11,878 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2019-12-07 18:35:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:11,878 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-12-07 18:35:11,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-12-07 18:35:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:35:11,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:11,879 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:12,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:35:12,081 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1692963281, now seen corresponding path program 1 times [2019-12-07 18:35:12,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:12,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383426481] [2019-12-07 18:35:12,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:12,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:35:12,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:12,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:12,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383426481] [2019-12-07 18:35:12,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:12,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:35:12,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206933624] [2019-12-07 18:35:12,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:12,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:12,244 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2019-12-07 18:35:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:12,252 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 18:35:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:12,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 18:35:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:12,252 INFO L225 Difference]: With dead ends: 27 [2019-12-07 18:35:12,252 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 18:35:12,253 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 18:35:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 18:35:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 18:35:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 18:35:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 18:35:12,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2019-12-07 18:35:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:12,255 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 18:35:12,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-12-07 18:35:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:35:12,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:12,255 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:12,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:35:12,457 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 942254559, now seen corresponding path program 1 times [2019-12-07 18:35:12,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:12,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333750774] [2019-12-07 18:35:12,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:12,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:35:12,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:12,672 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:12,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333750774] [2019-12-07 18:35:12,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:12,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-12-07 18:35:12,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570741512] [2019-12-07 18:35:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:35:12,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:35:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:35:12,746 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2019-12-07 18:35:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:12,917 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-12-07 18:35:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:35:12,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 18:35:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:12,918 INFO L225 Difference]: With dead ends: 55 [2019-12-07 18:35:12,918 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 18:35:12,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:35:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 18:35:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-07 18:35:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 18:35:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 18:35:12,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2019-12-07 18:35:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:12,923 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 18:35:12,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:35:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 18:35:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:35:12,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:12,924 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:13,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:35:13,126 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -854879341, now seen corresponding path program 1 times [2019-12-07 18:35:13,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:13,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342861569] [2019-12-07 18:35:13,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:13,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:35:13,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:13,274 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 18:35:13,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:13,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:35:13,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:35:13,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:35:13,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:35:13,329 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 18:35:13,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:13,345 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:35:13,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:35:13,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 18:35:13,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-12-07 18:35:13,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:13,389 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 18:35:13,390 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 18:35:13,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 18:35:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:13,410 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:13,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342861569] [2019-12-07 18:35:13,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:13,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2019-12-07 18:35:13,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461051267] [2019-12-07 18:35:13,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:35:13,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:13,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:35:13,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:35:13,549 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 10 states. [2019-12-07 18:35:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:15,692 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-12-07 18:35:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:35:15,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 18:35:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:15,693 INFO L225 Difference]: With dead ends: 50 [2019-12-07 18:35:15,693 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 18:35:15,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:35:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 18:35:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-12-07 18:35:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 18:35:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 18:35:15,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2019-12-07 18:35:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:15,696 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 18:35:15,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:35:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 18:35:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:35:15,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:15,697 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:15,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:35:15,899 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1051392846, now seen corresponding path program 1 times [2019-12-07 18:35:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:15,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590198673] [2019-12-07 18:35:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:16,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:35:16,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:16,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:35:16,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:16,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:35:16,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:35:16,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-12-07 18:35:16,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 18:35:16,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:35:16,092 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 18:35:16,092 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:35:16,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:13 [2019-12-07 18:35:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:16,105 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:16,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590198673] [2019-12-07 18:35:16,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:16,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-07 18:35:16,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944420642] [2019-12-07 18:35:16,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:35:16,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:16,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:35:16,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:35:16,212 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 15 states. [2019-12-07 18:35:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:16,662 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-12-07 18:35:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:35:16,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-07 18:35:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:16,664 INFO L225 Difference]: With dead ends: 53 [2019-12-07 18:35:16,665 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 18:35:16,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:35:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 18:35:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-12-07 18:35:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 18:35:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 18:35:16,674 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2019-12-07 18:35:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:16,674 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 18:35:16,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:35:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 18:35:16,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:35:16,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:16,676 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:16,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:35:16,878 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, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:16,879 INFO L82 PathProgramCache]: Analyzing trace with hash 498430356, now seen corresponding path program 2 times [2019-12-07 18:35:16,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:16,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694731440] [2019-12-07 18:35:16,881 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/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 18:35:17,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:35:17,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:35:17,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:35:17,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:17,039 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:35:17,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694731440] [2019-12-07 18:35:17,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:17,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:35:17,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909651232] [2019-12-07 18:35:17,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:35:17,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:35:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:17,052 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-12-07 18:35:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:17,065 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-12-07 18:35:17,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:17,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:35:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:17,066 INFO L225 Difference]: With dead ends: 43 [2019-12-07 18:35:17,066 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 18:35:17,067 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 18:35:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 18:35:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-12-07 18:35:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 18:35:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-12-07 18:35:17,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2019-12-07 18:35:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:17,071 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-12-07 18:35:17,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:35:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-12-07 18:35:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:35:17,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:17,072 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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 18:35:17,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:35:17,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:35:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1446021946, now seen corresponding path program 1 times [2019-12-07 18:35:17,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:35:17,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440322440] [2019-12-07 18:35:17,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:35:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:17,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:35:17,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:35:21,502 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:35:39,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse0 v_entry_point_~q~0.base_17) (_ bv0 1))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-12-07 18:35:39,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from false [2019-12-07 18:35:39,198 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32))) (or (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from true [2019-12-07 18:35:39,222 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_9| (Array (_ BitVec 32) (_ BitVec 1))) (v_entry_point_~p~0.base_BEFORE_CALL_10 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_74| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_74|) (_ bv0 1))) (exists ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (and (forall ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23 (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17))) (not (= (select |v_old(#valid)_BEFORE_CALL_9| v_entry_point_~p~0.base_23) (_ bv0 1))) (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)))) (not (= (store (store |c_old(#valid)| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret39.base_45|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_74| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_10 (_ bv0 1))) (exists ((v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_9| v_prenex_2 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse1 v_prenex_3)) (not (= v_prenex_1 (store (store .cse1 v_prenex_3 (_ bv0 1)) v_prenex_2 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_9| v_prenex_2) (_ bv0 1))))))))) is different from true [2019-12-07 18:35:39,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse0 v_entry_point_~q~0.base_17) (_ bv0 1))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-12-07 18:35:39,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32)) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret38.base_53|) (_ bv0 1))) (= (store (store .cse0 |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|) (not (= (select .cse0 |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_23)) (not (= (store (store .cse1 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|)) (= (select .cse1 v_entry_point_~q~0.base_17) (_ bv0 1)))))))) is different from false [2019-12-07 18:35:39,787 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:35:39,793 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 18:35:39,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))))) (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (and (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_10| v_prenex_6 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_6))) (not (= (_ bv0 1) (select .cse1 v_prenex_7))) (= v_prenex_4 (store (store .cse1 v_prenex_7 (_ bv0 1)) v_prenex_6 (_ bv0 1)))))) (not (= v_prenex_4 (store (store .cse2 v_prenex_5 (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_53|)) (= (_ bv0 1) (select .cse2 v_prenex_5))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from false [2019-12-07 18:35:39,804 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_8| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret39.base_45| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_entry_point_#t~ret39.base_45|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_23 (_ BitVec 32)) (v_entry_point_~q~0.base_17 (_ BitVec 32))) (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_entry_point_~q~0.base_17)) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_entry_point_~p~0.base_23)) (not (= (store (store .cse0 v_entry_point_~q~0.base_17 (_ bv0 1)) v_entry_point_~p~0.base_23 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))))) (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1))) (|v_entry_point_#t~ret38.base_53| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_#t~ret38.base_53| (_ bv1 1)))) (and (forall ((v_prenex_7 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse1 (store |v_old(#valid)_BEFORE_CALL_10| v_prenex_6 (_ bv1 1)))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_10| v_prenex_6))) (not (= (_ bv0 1) (select .cse1 v_prenex_7))) (= v_prenex_4 (store (store .cse1 v_prenex_7 (_ bv0 1)) v_prenex_6 (_ bv0 1)))))) (not (= v_prenex_4 (store (store .cse2 v_prenex_5 (_ bv0 1)) |v_entry_point_#t~ret38.base_53| (_ bv0 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_53|)) (= (_ bv0 1) (select .cse2 v_prenex_5))))) (= (store (store |c_#valid| |v_entry_point_#t~ret39.base_45| (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_8|))) is different from true [2019-12-07 18:35:39,808 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:35:39,813 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 18:35:39,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:35:39,824 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 18:35:40,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:35:40,026 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_8|], 24=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-12-07 18:35:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-12-07 18:35:40,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440322440] [2019-12-07 18:35:40,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:40,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2019-12-07 18:35:40,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954917094] [2019-12-07 18:35:40,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:35:40,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:35:40,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:35:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=144, Unknown=73, NotChecked=198, Total=462 [2019-12-07 18:35:40,039 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 10 states. [2019-12-07 18:36:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:36:24,767 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 18:36:24,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:36:24,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-12-07 18:36:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:36:24,769 INFO L225 Difference]: With dead ends: 52 [2019-12-07 18:36:24,769 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 18:36:24,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=47, Invalid=144, Unknown=73, NotChecked=198, Total=462 [2019-12-07 18:36:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 18:36:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-12-07 18:36:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 18:36:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-12-07 18:36:24,772 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2019-12-07 18:36:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:36:24,773 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-12-07 18:36:24,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:36:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-12-07 18:36:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:36:24,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:36:24,773 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 18:36:24,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:36:24,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:36:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:36:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1152618939, now seen corresponding path program 1 times [2019-12-07 18:36:24,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:36:24,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628965268] [2019-12-07 18:36:24,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:36:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:36:25,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:36:25,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:36:25,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 18:36:25,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:36:25,112 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 18:36:25,112 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 18:36:25,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 18:36:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:36:29,348 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:36:41,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= (store (store |c_#valid| c_entry_point_~q~0.base (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|))) is different from false [2019-12-07 18:36:41,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) c_entry_point_~p~0.base (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-12-07 18:36:41,969 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 18:36:41,972 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 18:36:41,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from false [2019-12-07 18:36:41,983 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from true [2019-12-07 18:36:41,984 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 18:36:41,987 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 18:36:41,989 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 18:36:41,991 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 18:36:41,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from false [2019-12-07 18:36:42,002 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1))))))))) is different from true [2019-12-07 18:36:42,004 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 18:36:42,007 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 18:36:42,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))) (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|))) is different from false [2019-12-07 18:36:42,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1))) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_entry_point_~p~0.base_27)) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= (store (store (store |c_old(#valid)| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|)))))) is different from false [2019-12-07 18:36:42,068 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:36:42,072 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-12-07 18:36:42,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from false [2019-12-07 18:36:42,084 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from true [2019-12-07 18:36:42,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:36:42,090 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-12-07 18:36:42,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:36:42,098 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-12-07 18:36:42,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from false [2019-12-07 18:36:42,118 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) is different from true [2019-12-07 18:36:42,120 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 18:36:42,123 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_14|], 7=[|v_old(#valid)_BEFORE_CALL_16|]} [2019-12-07 18:36:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-12-07 18:36:42,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628965268] [2019-12-07 18:36:42,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:36:42,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-12-07 18:36:42,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475238950] [2019-12-07 18:36:42,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:36:42,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:36:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:36:42,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=250, Unknown=52, NotChecked=328, Total=702 [2019-12-07 18:36:42,206 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 27 states. [2019-12-07 18:37:15,293 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|))) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= (select |c_old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |c_#valid| |c_old(#valid)|)) is different from true [2019-12-07 18:37:15,302 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_86| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store (store |c_#valid| |v_ldv_malloc_#t~malloc12.base_86| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_86| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_86|) (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_86|) (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 18:37:15,310 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ldv_malloc_#res.base| (_ bv0 32))) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#t~malloc12.base_85| (_ BitVec 32))) (and (not (= (store (store (store |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85| (_ bv1 1)) (_ bv0 32) (_ bv0 1)) |v_ldv_malloc_#t~malloc12.base_85| (_ bv0 1)) v_prenex_10)) (not (= (_ bv0 32) |v_ldv_malloc_#t~malloc12.base_85|)) (forall ((v_prenex_11 (_ BitVec 32))) (or (= v_prenex_11 (_ bv0 32)) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_11))) (= v_prenex_10 (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_11 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_11 (_ bv0 1))))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_85|) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_14| (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_entry_point_~p~0.base_27)))))) (= (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 18:37:33,581 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1)))))))))) is different from false [2019-12-07 18:37:41,720 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_ldv_malloc_#res.base| (_ bv0 32)) (forall ((v_entry_point_~p~0.base_BEFORE_CALL_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_14|) (exists ((v_entry_point_~p~0.base_27 (_ BitVec 32))) (and (not (= v_entry_point_~p~0.base_27 (_ bv0 32))) (not (= |v_old(#valid)_BEFORE_CALL_14| (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_27 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~p~0.base_27)))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_8 (store (store |c_old(#valid)| (_ bv0 32) (_ bv0 1)) v_entry_point_~p~0.base_BEFORE_CALL_12 (_ bv0 1)))) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_9))) (= v_prenex_9 (_ bv0 32)) (= v_prenex_8 (store (store (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_9 (_ bv1 1)) (_ bv0 32) (_ bv0 1)) v_prenex_9 (_ bv0 1)))))))))) is different from false [2019-12-07 18:38:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:21,271 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-12-07 18:38:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:38:21,272 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-12-07 18:38:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:21,272 INFO L225 Difference]: With dead ends: 56 [2019-12-07 18:38:21,272 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 18:38:21,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=111, Invalid=374, Unknown=73, NotChecked=702, Total=1260 [2019-12-07 18:38:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 18:38:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-12-07 18:38:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 18:38:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-12-07 18:38:21,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2019-12-07 18:38:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:21,276 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-12-07 18:38:21,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:38:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-12-07 18:38:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:38:21,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:21,277 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 18:38:21,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:38:21,479 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 18:38:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1037197721, now seen corresponding path program 2 times [2019-12-07 18:38:21,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:38:21,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045073179] [2019-12-07 18:38:21,482 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 18:38:21,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:38:21,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:38:21,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:38:21,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:38:21,661 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:38:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:38:21,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045073179] [2019-12-07 18:38:21,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:21,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-12-07 18:38:21,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676188434] [2019-12-07 18:38:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:38:21,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:38:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:38:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:38:21,687 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 6 states. [2019-12-07 18:38:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:21,702 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-12-07 18:38:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:38:21,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 18:38:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:21,703 INFO L225 Difference]: With dead ends: 25 [2019-12-07 18:38:21,703 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:38:21,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:38:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:38:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:38:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:38:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:38:21,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-12-07 18:38:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:21,704 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:38:21,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:38:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:38:21,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:38:21,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:38:21,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:38:21 BoogieIcfgContainer [2019-12-07 18:38:21,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:38:21,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:38:21,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:38:21,909 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:38:21,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:09" (3/4) ... [2019-12-07 18:38:21,911 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:38:21,916 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-12-07 18:38:21,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-12-07 18:38:21,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-12-07 18:38:21,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-12-07 18:38:21,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-12-07 18:38:21,925 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-12-07 18:38:21,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 18:38:21,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:38:21,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:38:21,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:38:21,965 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_01d9fb6b-1e49-415e-ab13-b4d2b1fbf258/bin/uautomizer/witness.graphml [2019-12-07 18:38:21,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:38:21,966 INFO L168 Benchmark]: Toolchain (without parser) took 194252.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 156.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:38:21,967 INFO L168 Benchmark]: CDTParser took 0.13 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 18:38:21,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:38:21,967 INFO L168 Benchmark]: Boogie Preprocessor took 62.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:38:21,967 INFO L168 Benchmark]: RCFGBuilder took 910.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.8 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:38:21,967 INFO L168 Benchmark]: TraceAbstraction took 192788.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -113.9 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:38:21,968 INFO L168 Benchmark]: Witness Printer took 56.92 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:38:21,969 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.13 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 430.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 910.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.8 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192788.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -113.9 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.92 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 765]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 77 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 344 locations, 77 error locations. Result: SAFE, OverallTime: 192.7s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 146.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 251 SDslu, 1159 SDs, 0 SdLazy, 1123 SolverSat, 102 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 129.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 655 GetRequests, 520 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 56.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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, 14 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 618 ConstructedInterpolants, 87 QuantifiedInterpolants, 127306 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1187 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 64/96 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 proved your program to be correct! Received shutdown request...